65 search results - page 6 / 13 » Generating and measuring instances of hard semidefinite prog... |
TASE
2010
IEEE
13 years 2 months ago
2010
IEEE
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
ISSTA
2006
ACM
14 years 1 months ago
2006
ACM
The popularity of object-oriented programming has led to the wide use of container libraries. It is important for the reliability of these containers that they are tested adequate...
AAAI
2008
13 years 9 months ago
2008
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
MP
2010
13 years 5 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
JMLR
2006
13 years 7 months ago
2006
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...