3758 search results - page 202 / 752 » A Complete Subsumption Algorithm |
118
Voted
CHARME
1997
Springer
15 years 5 months ago
1997
Springer
Formal verification techniques need to deal with the complexity of the systems rified. Most often, this problem is solved by taking an abstract model of the system and aiming at a...
130
click to vote
OPODIS
2008
15 years 3 months ago
2008
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
108
Voted
DISOPT
2010
15 years 2 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
113
Voted
IPL
2008
15 years 2 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
103
click to vote
RAS
2008
15 years 1 months ago
2008
Motivated by potential efficiency and robustness gains, there is growing interest in the use of multiple robots for coverage. In coverage, robots visit every point in a target are...