LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Name
COMPUTING AND INFORMATICS
Type
Journal
Items
984 Publications
Compatibility
OpenAIRE Basic (DRIVER OA)
OAI-PMH
http://www.cai.sk/ojs/index.php/cai/oai

 

  • Evaluation of Differential Methods for Image Velocity Measurement

    For eight point-based differential methods of image velocity measurement, including two new methods, quantitative evaluations are reported based on synthetic images, and qualitative evaluations based on real images.  A new method  (cluster method) is characterized by the determination of the nearest point to all constraint lines, and the other (VF expansion method) by local approximation of the motion vector field. For six methods, solutions for algorithmic use are compiled, e.g. al...

    Improved Reasoning About Infinity Using Qualitative Simulation

    The AI technique of qualitative simulation, enabling the representation and use of incomplete knowledge, is a useful mathematical tool, especially for the analysis, design, and diagnosis of dynamic systems. One desirable property of qualitative simulators is their ability to handle infinite ``values'' explicitly, leading to formal predictions about asymptotic behavior. We present two modifications to the qualitative simulation algorithm QSIM, which improve the technique's performance in reaso...

    ON DERIVATIVES ESTIMATION OF SMOOTHED DIGITAL CURVES

    Ján Glasa (2012)
    In this paper new linear operators for the first derivatives estimation of smoothed digital curves are presented. They correspond to digital curves smoothing by various non-negative kernels.

    Genetic Algorithm Approach for Solving the Machine-Job Assignment with Controllable Processing Times

    This paper considers a genetic algorithm (GA) for a machine-job assignment with controllable processing times (MJACPT). Integer representation with standard genetic operators is used. In an objective function, a job assignment is obtained from genetic code and for this, fixed assignment processing times are calculated by solving a constrained nonlinear convex optimization problem. Additionally, the job assignment of each individual is improved by local search. Computational results are presen...

    Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks

    In a localized routing algorithm, node A currently holding the message forwards it based on the location of itself, its neighboring nodes and destination. We propose to use depth first search (DFS) method for routing decisions. Each node A, upon receiving the message for the first time, sorts all its neighbors according to a criterion, such as their distance to destination, and uses that order in DFS algorithm. It is the first localized algorithm that guarantees delivery for (connected) wirel...
  • No data provider research data found
  • Latest Documents Timeline

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Document Types

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Funders in data provider publications

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

    Projects with most Publications

    Chart is loading... It may take a bit of time. Please be patient and don't reload the page.

Share - Bookmark