Sciweavers

1037 search results - page 204 / 208
» Topic Models Conditioned on Relations
Sort
View
CP
2001
Springer
15 years 1 months ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken
CEC
2009
IEEE
15 years 22 days ago
The coevolution of loyalty and cooperation
— Humans are inclined to engage in long-lasting relationships whose stability does not only rely on cooperation, but often also on loyalty — our tendency to keep interacting wi...
Sven Van Segbroeck, Francisco C. Santos, Ann Now&e...
IJCAI
2001
14 years 10 months ago
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
Alan M. Frisch, Timothy J. Peugniez
AAAI
1994
14 years 10 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 9 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...