Sciweavers

3172 search results - page 54 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
ENDM
2007
104views more  ENDM 2007»
15 years 20 days ago
Matching graphs of Hypercubes and Complete Bipartite Graphs
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...
Jirí Fink
93
Voted
ISER
2000
Springer
112views Robotics» more  ISER 2000»
15 years 4 months ago
Simulation and Experimental Evaluation of Complete Sensor-Based Coverage in Rectilinear Environments
: Although sensor-based coverage is a skill which is applicable to a variety of robot tasks, its implementation has so far been limited, mostly by the physical limitations of tradi...
Zack J. Butler, Alfred A. Rizzi, Ralph L. Hollis
105
Voted
ATAL
2006
Springer
15 years 4 months ago
Forming efficient agent groups for completing complex tasks
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
Efrat Manisterski, Esther David, Sarit Kraus, Nich...
104
Voted
COR
2007
80views more  COR 2007»
15 years 21 days ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
123
Voted
BMCBI
2007
161views more  BMCBI 2007»
15 years 25 days ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo