4480 search results - page 142 / 896 » Prototyping Completion with Constraints Using Computational ... |
227
click to vote
PLDI
1997
ACM
15 years 10 months ago
1997
ACM
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
160
click to vote
JODL
2006
15 years 6 months ago
2006
This paper presents a framework for providing dynamically deployable services in ubiquitous computing settings. The goal of the framework is to provide people, places, and objects ...
159
click to vote
LPNMR
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
168
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
154
click to vote
HPDC
2002
IEEE
15 years 11 months ago
2002
IEEE
We examine the use of Web services, an XML-based distributed object system, for developing reusable, interoperable services for computational science web portals. This paper descr...