Sciweavers

335 search results - page 54 / 67
» Solving the Hamiltonian path problem with a light-based comp...
Sort
View
ICC
2011
IEEE
201views Communications» more  ICC 2011»
12 years 7 months ago
Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
Chris Develder, Jens Buysse, Ali Shaikh, Brigitte ...
DAC
1994
ACM
13 years 11 months ago
Exact Minimum Cycle Times for Finite State Machines
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
William K. C. Lam, Robert K. Brayton, Alberto L. S...
JAL
2006
101views more  JAL 2006»
13 years 7 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
EEMMAS
2007
Springer
14 years 1 months ago
Swarms of Self-assembling Robots
In this talk I present recent research in swarm robotics, the discipline that studies robotic systems composed of swarms of robots tightly interacting and cooperating to reach thei...
Marco Dorigo
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
14 years 1 months ago
Landmark Selection for Task-Oriented Navigation
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
Ronen Lerner, Ehud Rivlin, Ilan Shimshoni