Sciweavers

1097 search results - page 120 / 220
» Revision Programming = Logic Programming Integrity Constra...
Sort
View
139
Voted
ATVA
2006
Springer
162views Hardware» more  ATVA 2006»
15 years 7 months ago
Predicate Abstraction of Programs with Non-linear Computation
e Abstraction of Programs With Non-linear Computation Songtao Xia1 Ben Di Vito2 Cesar Munoz3 1 NASA Postdoc at NASA Langley Research Center, Hampton, VA 2 NASA Langley Research Cen...
Songtao Xia, Ben Di Vito, César Muño...
APPROX
2010
Springer
147views Algorithms» more  APPROX 2010»
15 years 5 months ago
Approximate Lasserre Integrality Gap for Unique Games
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
Subhash Khot, Preyas Popat, Rishi Saket
131
Voted
DAC
2005
ACM
16 years 4 months ago
Robust gate sizing by geometric programming
We present an efficient optimization scheme for gate sizing in the presence of process variations. Using a posynomial delay model, the delay constraints are modified to incorporat...
Jaskirat Singh, Vidyasagar Nookala, Zhi-Quan Luo, ...
117
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
Web Service Composition via the Customization of Golog Programs with User Preferences
Abstract. We claim that user preferences are a key component of effective Web service composition, and one that has largely been ignored. In this paper we propose a means of speci...
Shirin Sohrabi, Nataliya Prokoshyna, Sheila A. McI...
FUIN
2010
116views more  FUIN 2010»
15 years 23 days ago
An Investigation of Multi-Agent Planning in CLP
This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper ...
Agostino Dovier, Andrea Formisano, Enrico Pontelli