Sciweavers

1040 search results - page 115 / 208
» Rounding algorithms for covering problems
Sort
View
PARELEC
2002
IEEE
15 years 2 months ago
Techniques for Optimization of Net Algorithms
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...
CCECE
2011
IEEE
13 years 9 months ago
An algorithm for object tracking based on adaptive triangle shape mesh estimation method
— Although "Adaptive Mesh" is regarded as complicating method for object tracking accompanied with many controversies and obstacles, but it has been proposed that such ...
Mahdi Koohi, Mahdi Narghi, Abbas Shakery
ICST
2010
IEEE
14 years 8 months ago
Repairing GUI Test Suites Using a Genetic Algorithm
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
Si Huang, Myra B. Cohen, Atif M. Memon
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
15 years 4 months ago
Optimal Tableau Algorithms for Coalgebraic Logics
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
Rajeev Goré, Clemens Kupke, Dirk Pattinson
ICRA
2003
IEEE
167views Robotics» more  ICRA 2003»
15 years 3 months ago
Local exploration: online algorithms and a probabilistic framework
— Mapping an environment with an imaging sensor becomes very challenging if the environment to be mapped is unknown and has to be explored. Exploration involves the planning of v...
Volkan Isler, Sampath Kannan, Kostas Daniilidis