1816 search results - page 115 / 364 » A New Approach for Solving the Maximum Clique Problem |
155
click to vote
KES
2008
Springer
15 years 6 months ago
2008
Springer
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimiza...
157
Voted
FOCS
2006
IEEE
16 years 4 days ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
135
click to vote
ECCC
2007
15 years 6 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
195
click to vote
CPAIOR
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
174
Voted
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...