Sciweavers

1137 search results - page 168 / 228
» Partial Program Admission
Sort
View
DB
2008
107views more  DB 2008»
13 years 9 months ago
Introducing function extraction into software testing
Software testing can benefit from technologies that enable evolution toward increased engineering discipline. In current practice, software developers lack practical means to dete...
Mark G. Pleszkoch, Richard C. Linger, Alan R. Hevn...
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 9 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
ML
2006
ACM
113views Machine Learning» more  ML 2006»
13 years 9 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
CLEIEJ
2002
113views more  CLEIEJ 2002»
13 years 9 months ago
The MT Stack: Paging Algorithm and Performance in a Distributed Virtual Memory System
Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages ...
Marco T. Morazán, Douglas R. Troeger, Myles...
MP
1998
108views more  MP 1998»
13 years 9 months ago
Base polytopes of series-parallel posets: Linear description and optimization
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
Rainer Schrader, Andreas S. Schulz, Georg Wambach