1144 search results - page 29 / 229 » Logic programming for combinatorial problems |
102
click to vote
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
114
click to vote
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
107
click to vote
SIGECOM
2003
ACM
15 years 7 months ago
2003
ACM
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
130
click to vote
LOPSTR
1997
Springer
15 years 6 months ago
1997
Springer
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
115
click to vote
IFIP
1998
Springer
15 years 6 months ago
1998
Springer
A new scheduling agent for existing CIM multi-agent system is being currently developed at the Technical University of Kosice. The basic idea is to create an agent based on Schedu...