Sciweavers

3016 search results - page 396 / 604
» The Online Transportation Problem
Sort
View
WEA
2005
Springer
154views Algorithms» more  WEA 2005»
15 years 10 months ago
Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismai...
ATVA
2004
Springer
87views Hardware» more  ATVA 2004»
15 years 10 months ago
Synthesis of State Feedback Controllers for Parameterized Discrete Event Systems
— This paper considers the state feedback control of parameterized discrete event systems consisting of N similar processes for the problem of maintaining a predicate on the stat...
Hans Bherer, Jules Desharnais, Marc Frappier, Rich...
DAWAK
2004
Springer
15 years 10 months ago
Mining Maximal Frequently Changing Subtree Patterns from XML Documents
Abstract. Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...
ECAI
2004
Springer
15 years 10 months ago
Active Learning for Robot Manipulation
Abstract— Learning techniques in robotic grasping applications have usually been concerned with the way a hand approaches to an object, or with improving the motor control of man...
Antonio Morales, Eris Chinellato, Andrew H. Fagg, ...
GECCO
2004
Springer
15 years 10 months ago
Non-stationary Subtasks Can Improve Diversity in Stationary Tasks
Low diversity in a genetic algorithm (GA) can cause the search to become stagnant upon reaching a local optimum. To some extent, non-stationary tasks avoid this problem, which woul...
Christopher Willis-Ford, Terence Soule