1299 search results - page 209 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
ICCAD
2003
IEEE
15 years 6 months ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
ICDE
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— Satisfying energy constraints while meeting performance requirements is a primary concern when a sensor network is being deployed. Many recent proposed techniques offer...
ADHOCNOW
2008
Springer
15 years 4 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper presents a new routing strategy, that selects the best network paths in an overlay network, in order to minimize the distortion perceived by the end user. We first pro...