Sciweavers

8446 search results - page 1281 / 1690
» A Process Compensation Language
Sort
View
ICLP
2009
Springer
16 years 6 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
ICALP
2009
Springer
16 years 6 months ago
The Number of Symbol Comparisons in QuickSort and QuickSelect
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
Brigitte Vallée, James Allen Fill, Julien C...
ICALP
2009
Springer
16 years 6 months ago
Reachability in Stochastic Timed Games
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
Patricia Bouyer, Vojtech Forejt
SIGMOD
2009
ACM
143views Database» more  SIGMOD 2009»
16 years 6 months ago
Data integration in mashups
Mashup is a new application development approach that allows users to aggregate multiple services to create a service for a new purpose. Even if the Mashup approach opens new and ...
Giusy Di Lorenzo, Hakim Hacid, Hye-Young Paik, Bou...
SIGMOD
2003
ACM
154views Database» more  SIGMOD 2003»
16 years 6 months ago
The Cougar Project: a work-in-progress report
We present an update on the status of the Cougar Sensor Database Project, in which we are investigating a database approach to sensor networks: Clients "program" the sen...
Alan J. Demers, Johannes Gehrke, Rajmohan Rajarama...
« Prev « First page 1281 / 1690 Last » Next »