6142 search results - page 310 / 1229 » The Complexity of Partition Functions |
156
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— The main aspect in multi-robot exploration is the efficient coordination of a group of robots. Inspired by previous results on the coverage problem, we propose a novel, fronti...
135
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
Abstract— In this paper, we describe the design and implementation of the primary memory system of the TRIPS processor. To match the aggressive execution bandwidth and support hi...
164
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
An architectural framework is studied that can perform dynamic reconfiguration. A basic objective is to dynamically reconfigure the architecture so that its configuration is well ...
155
click to vote
FSTTCS
2007
Springer
16 years 24 days ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
193
click to vote
ICTAI
2005
IEEE
16 years 7 days ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...