Sciweavers

3333 search results - page 480 / 667
» Abstract Proof Search
Sort
View
SPIRE
2005
Springer
15 years 11 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger
SSS
2005
Springer
15 years 11 months ago
A Snap-Stabilizing DFS with a Lower Space Requirement
Abstract. A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In [4], we presented the first snap-stab...
Alain Cournier, Stéphane Devismes, Vincent ...
MM
2004
ACM
88views Multimedia» more  MM 2004»
15 years 11 months ago
A general framework for multidimensional adaptation
Data adaptation is an essential system component in a wide variety of application areas. To date, most applications use ad hoc methods to manage data in response to limited resour...
David Gotz, Ketan Mayer-Patel
SIGIR
2004
ACM
15 years 11 months ago
A logic-based approach for computing service executions plans in peer-to-peer networks
Abstract. Today, peer-to-peer services can comprise a large and growing number of services, e.g. search services or services dealing with heterogeneous schemas in the context of Di...
Henrik Nottelmann, Norbert Fuhr
AMAI
2004
Springer
15 years 11 months ago
Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums
Abstract. We introduce a new global constraint which combines together the lexicographic ordering constraint with two sum constraints. Lexicographic ordering constraints are freque...
Brahim Hnich, Zeynep Kiziltan, Toby Walsh