Sciweavers

8695 search results - page 324 / 1739
» Making the Complex Simple
Sort
View
FOCS
1999
IEEE
15 years 11 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
POPL
1996
ACM
15 years 11 months ago
Using Parameterized Signatures to Express Modular Structure
Module systems are a powerful, practical tool for managing the complexity of large software systems. Previous attempts to formulate a type-theoretic foundation for modular program...
Mark P. Jones
ATAL
2006
Springer
15 years 10 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein
GPCE
2008
Springer
15 years 7 months ago
Lightweight dependent classes
Extensive research efforts have been devoted to implement a group of type-safe mutually recursive classes; recently, proposals for separating each member of the group as a reusabl...
Tetsuo Kamina, Tetsuo Tamai
AIED
2005
Springer
16 years 9 days ago
The Assistment Builder: A Rapid Development Tool for ITS
Intelligent Tutoring Systems are notoriously costly to construct [1], and require PhD level experience in cognitive science and rule based programming. The goal of this research wa...
Terrence E. Turner, Michael A. Macasek, Goss Nuzzo...