797 search results - page 159 / 160 » Eliminating Proofs from Programs |
126
Voted
ANOR
2005
15 years 2 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
139
Voted
JAIR
2007
15 years 2 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...
143
Voted
CP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
140
Voted
AI
2010
Springer
14 years 11 months ago
2010
Springer
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
156
Voted
CSCW
2012
ACM
13 years 10 months ago
2012
ACM
While the users of completed applications are heavily moving from desktop to the web browser, the majority of developers are still working with desktop IDEs such as Eclipse or Vis...