Sciweavers

1912 search results - page 303 / 383
» GOAL as a Planning Formalism
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 3 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
WWW
2005
ACM
16 years 7 months ago
A service creation environment based on end to end composition of Web services
The demand for quickly delivering new applications is increasingly becoming a business imperative today. Application development is often done in an ad hoc manner, without standar...
Vikas Agarwal, Koustuv Dasgupta, Neeran M. Karnik,...
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
16 years 6 months ago
Query Optimization In Compressed Database Systems
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
Zhiyuan Chen, Johannes Gehrke, Flip Korn
KBSE
2007
IEEE
16 years 17 days ago
Direct-dependency-based software compatibility testing
Software compatibility testing is an important quality assurance task aimed at ensuring that component-based software systems build and/or execute properly across a broad range of...
Il-Chul Yoon, Alan Sussman, Atif M. Memon, Adam A....
IUI
2005
ACM
15 years 12 months ago
Building intelligent shopping assistants using individual consumer models
This paper describes an Intelligent Shopping Assistant designed for a shopping cart mounted tablet PC that enables individual interactions with customers. We use machine learning ...
Chad M. Cumby, Andrew E. Fano, Rayid Ghani, Marko ...