663 search results - page 69 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
ESA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
DCC
2010
IEEE
14 years 2 months ago
2010
IEEE
Block-based random image sampling is coupled with a projectiondriven compressed-sensing recovery that encourages sparsity in the domain of directional transforms simultaneously wi...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
EURODAC
1995
IEEE
13 years 11 months ago
1995
IEEE
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
JOIN
2007
13 years 7 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...