Sciweavers

797 search results - page 159 / 160
» Eliminating Proofs from Programs
Sort
View
ANOR
2005
160views more  ANOR 2005»
13 years 5 months ago
Packing r-Cliques in Weighted Chordal Graphs
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...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
JAIR
2007
132views more  JAIR 2007»
13 years 5 months ago
New Inference Rules for Max-SAT
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ï¬...
Chu Min Li, Felip Manyà, Jordi Planes
CP
2010
Springer
13 years 3 months ago
A Box-Consistency Contractor Based on Extremal Functions
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...
Gilles Trombettoni, Yves Papegay, Gilles Chabert, ...
AI
2010
Springer
13 years 2 months ago
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition
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...
James Pita, Manish Jain, Milind Tambe, Fernando Or...
CSCW
2012
ACM
12 years 29 days ago
CoRED: browser-based Collaborative Real-time Editor for Java web applications
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...
Janne Lautamäki, Antti Nieminen, Johannes Kos...