Sciweavers

2950 search results - page 39 / 590
» Computing with Infinitely Many Processes
Sort
View
JCT
2008
84views more  JCT 2008»
13 years 8 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas
JDA
2006
77views more  JDA 2006»
13 years 8 months ago
On Multi-threaded Metrical Task Systems
Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general mod...
Esteban Feuerstein, Steven S. Seiden, Alejandro St...
SIAMJO
2008
99views more  SIAMJO 2008»
13 years 8 months ago
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
Marco C. Campi, Simone Garatti
AI
2008
Springer
13 years 7 months ago
MEBN: A language for first-order Bayesian knowledge bases
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Kathryn B. Laskey
MMAS
2010
Springer
13 years 3 months ago
Simplified Modelling of a Thermal Bath, with Application to a Fluid Vortex System
Based on the thermodynamic concept of a reservoir, we investigate a computational model for interaction with unresolved degrees of freedom (a thermal bath). We assume that a finite...
Svetlana Dubinkina, Jason Frank, Ben Leimkuhler