152 search results - page 9 / 31 » An Experimental Study of Random Knapsack Problems |
102
Voted
SAT
2005
Springer
15 years 6 months 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...
110
Voted
COR
2007
15 years 12 days 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...
106
click to vote
AISC
2008
Springer
15 years 2 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...
131
Voted
ECAI
2010
Springer
14 years 10 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...
101
click to vote
SIGMOD
1999
ACM
15 years 4 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 ...