152 search results - page 9 / 31 » An Experimental Study of Random Knapsack Problems |
SAT
2005
Springer
14 years 6 days ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
COR
2007
13 years 6 months ago
2007
Disruptions in trips can prevent vehicles from executing their schedules as planned. Mechanical failures, accidents, and traffic congestion often hinder a vehicle schedule. When a...
AISC
2008
Springer
13 years 8 months ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
ECAI
2010
Springer
13 years 4 months ago
2010
Springer
Conditional random fields (CRF) are widely used for predicting output variables that have some internal structure. Most of the CRF research has been done on structured classificati...
SIGMOD
1999
ACM
13 years 11 months ago
1999
ACM
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...