1040 search results - page 165 / 208 » Rounding algorithms for covering problems |
56
Voted
ACL
1998
14 years 11 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
50
Voted
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract-- jMetal is a Java-based framework for multiobjective optimization using metaheuristics. It is an ease-to-use, flexible, and extensible software package that has been used...
60
Voted
CONSTRAINTS
2007
14 years 9 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...
MP
2007
14 years 9 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...
122
click to vote
TASE
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...