1816 search results - page 54 / 364 » A New Approach for Solving the Maximum Clique Problem |
174
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
202
click to vote
AUSAI
2008
Springer
15 years 7 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
170
click to vote
HEURISTICS
2010
15 years 3 months ago
2010
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
130
Voted
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
171
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
We study the problem of simultaneously estimating several densities where the datasets are organized into overlapping groups, such as a hierarchy. For this problem, we propose a m...