1952 search results - page 322 / 391 » Complete partitions of graphs |
116
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— This paper introduces the multi-robot boundary coverage problem, wherein a group of k robots must inspect every point on the boundary of a 2-dimensional test environment. Using...
137
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
134
Voted
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
150
click to vote
IPSN
2005
Springer
15 years 10 months ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
150
Voted
LACL
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...