2496 search results - page 241 / 500 » On covering by translates of a set |
148
click to vote
CONSTRAINTS
2007
15 years 6 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...
170
Voted
COR
2007
15 years 6 months ago
2007
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
158
click to vote
DKE
2007
15 years 6 months ago
2007
In our days knowledge extraction methods are able to produce artifacts (also called patterns) that concisely represent data. Patterns are usually quite heterogeneous and require a...
177
Voted
JUCS
2008
15 years 6 months ago
2008
: This paper addresses the role of Personal Digital Assistants (PDAs) in electronic meetings. Several real-world scenarios of PDA usage in meetings are defined using a pattern lang...
145
click to vote
JGAA
2006
15 years 6 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...