Sciweavers

1359 search results - page 90 / 272
» Black-Box Program Specialization
Sort
View
FLAIRS
2004
13 years 10 months ago
Constraint Processing with Reactive Agents
The integration of methods of Constraint Programming and Multi-Agent-Systems is discussed in this paper. We describe different agent topologies for Constraint Satisfaction Problem...
Georg Ringwelski, Richard J. Wallace
MP
2006
121views more  MP 2006»
13 years 8 months ago
Approximate fixed-rank closures of covering problems
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Daniel Bienstock, Mark Zuckerberg
LISP
1998
57views more  LISP 1998»
13 years 8 months ago
A Generalization of Jumps and Labels
This paper describes a new language feature that is a hybrid of labels and procedures. It is closely related to jumping out of a functional subroutine, and includes conventional la...
Peter J. Landin
SIGCSE
2002
ACM
185views Education» more  SIGCSE 2002»
13 years 8 months ago
Computer science accessibility for students with visual disabilities
Students with visual disabilities face unique challenges in learning to be computer scientists. These challenges can be overcome, however, with the use of specialized software too...
Joan M. Francioni, Ann C. Smith
SIAMREV
2010
181views more  SIAMREV 2010»
13 years 3 months ago
A Variational Approach to Copositive Matrices
This work surveys essential properties of the so-called copositive matrices, the study of which is spread over more than fifty-five years. Special emphasis is given to variational ...
Jean-Baptiste Hiriart-Urruty, Alberto Seeger