Sciweavers

240 search results - page 47 / 48
» Incorporating Tables into Proofs
Sort
View
CP
2005
Springer
13 years 11 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
13 years 10 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
DCG
2008
118views more  DCG 2008»
13 years 5 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk
JUCS
2008
145views more  JUCS 2008»
13 years 5 months ago
Ontoolcole: Supporting Educators in the Semantic Search of CSCL Tools
Abstract: Collaborative learning systems can be constructed following the serviceoriented computing paradigm. This allows educators to integrate external tools, offered as services...
Guillermo Vega-Gorgojo, Miguel L. Bote-Lorenzo, Ed...
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