12015 search results - page 514 / 2403 » Interactive Algorithms 2005 |
152
Voted
JGAA
2006
15 years 5 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
252
click to vote
SIGMOD
2005
ACM
16 years 5 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
163
Voted
CIBCB
2005
IEEE
15 years 10 months ago
2005
IEEE
— In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of memetic algori...
140
Voted
DSN
2005
IEEE
15 years 10 months ago
2005
IEEE
Designing a distributed fault tolerance algorithm requires careful analysis of both fault models and diagnosis strategies. A system will fail if there are too many active faults, ...
159
Voted
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...