1952 search results - page 246 / 391 » Complete partitions of graphs |
191
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
170
click to vote
ICRA
2006
IEEE
16 years 14 days ago
2006
IEEE
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
205
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
147
click to vote
ICCAD
2007
IEEE
2007
IEEE
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
16 years 3 months ago
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
161
click to vote
COMPSAC
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper considers the task of software test case generation from a large space of values of input parameters. The purpose of the paper is to create a model of software input ...