16504 search results - page 102 / 3301 » New Problems, New Solutions |
140
click to vote
ICALP
1999
Springer
15 years 10 months ago
1999
Springer
We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove
152
click to vote
ADBIS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
188
click to vote
ESA
2007
Springer
16 years 15 days ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
156
click to vote
I3E
2001
15 years 7 months ago
2001
: This paper explores how e-government can be understood in the context of business administration. An attempt is made to identify the greatest problems
173
click to vote
ECML
2005
Springer
15 years 12 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...