284 search results - page 31 / 57 » On Some Polyhedra Covering Problems |
ENTCS
2006
13 years 8 months ago
2006
Partial functions and operators are used extensively in the formal development of programs and thus development methods have to clarify how to reason about them. There are a numbe...
CONSTRAINTS
2007
13 years 8 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
NJC
2006
13 years 8 months ago
2006
In model based design model fragments are used in everyday work. Concurrent operations on separate parts of a model and communication between stakeholders are some examples. Howeve...
MP
2007
13 years 8 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
MST
2010
13 years 3 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...