Sciweavers

13841 search results - page 2257 / 2769
» Algorithms and Constraint Programming
Sort
View
KIVS
2005
Springer
16 years 5 days ago
Ranked Matching for Service Descriptions Using OWL-S
Abstract. Semantic Web services envision the automated discovery and selection of Web services. This can be realised by adding semantic information to advertised services and servi...
Michael C. Jaeger, Gregor Rojec-Goldmann, Christop...
NOSSDAV
2005
Springer
16 years 5 days ago
Using n-trees for scalable event ordering in peer-to-peer games
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
Chris GauthierDickey, Virginia Mary Lo, Daniel Zap...
SSD
2005
Springer
153views Database» more  SSD 2005»
16 years 5 days ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
VLDB
2005
ACM
140views Database» more  VLDB 2005»
16 years 5 days ago
Complex Spatio-Temporal Pattern Queries
This paper introduces a novel type of query, what we name Spatio-temporal Pattern Queries (STP). Such a query specifies a spatiotemporal pattern as a sequence of distinct spatial...
Marios Hadjieleftheriou, George Kollios, Petko Bak...
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
16 years 5 days ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
« Prev « First page 2257 / 2769 Last » Next »