Sciweavers

1359 search results - page 91 / 272
» Black-Box Program Specialization
Sort
View
CP
2003
Springer
14 years 2 months ago
Semi-independent Partitioning: A Method for Bounding the Solution to COP's
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
David Larkin
ICALP
2003
Springer
14 years 2 months ago
Oracle Circuits for Branching-Time Model Checking
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
Ph. Schnoebelen
ISIPTA
1999
IEEE
14 years 1 months ago
Treatment Choice Under Ambiguity Induced by Inferential Problems
Inferential problems that arise in the empirical analysis oftreatmentresponseinduceambiguityabouttheidentity of optimal treatment rules. This paper describes a research program th...
Charles F. Manski
ISIM
2007
13 years 10 months ago
Notes on Restricted P Colonies
We continue the investigation of P coloniesintroduced in [7], of abstract computing devices composed of independent agents, acting and evolving in a shared environment. We determin...
Lucie Ciencialová, Ludek Cienciala
AAAI
2004
13 years 10 months ago
Loop Formulas for Circumscription
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
Joohyung Lee, Fangzhen Lin