4513 search results - page 721 / 903 » Logic programming with satisfiability |
137
click to vote
CP
2007
Springer
15 years 9 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
135
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
118
Voted
ACMICEC
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we describe the operation of barter trade exchanges by identifying key techniques used by trade brokers to stimulate trade and satisfy member needs, and present alg...
141
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper proposes a unique feedback governed multi layered architectural model to support ISP's traffic demands with multiple Quality of Service(QoS) constraints. The propos...
138
Voted
EDBT
2010
ACM
15 years 6 months ago
2010
ACM
Data mining is increasingly performed by people who are not computer scientists or professional programmers. It is often done as an iterative process involving multiple ad-hoc tas...