Sciweavers

2584 search results - page 6 / 517
» On the Forward Checking Algorithm
Sort
View
COMPULOG
1999
Springer
14 years 2 days ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
ICN
2007
Springer
14 years 1 months ago
Succinct Representation of Static Packet Forwarding Tables
We develop algorithms for the compact representation of the trie structures that are used for Internet packet forwarding. Our compact representations are experimentally compared w...
Wencheng Lu, Sartaj Sahni
ENTCS
2006
122views more  ENTCS 2006»
13 years 7 months ago
Combining Aspect-Oriented and Strategic Programming
Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very ...
Karl Trygve Kalleberg, Eelco Visser
GLOBECOM
2006
IEEE
14 years 1 months ago
Evaluation of Dynamic Query Abolishment Methods in Heterogeneous Networks
— We compare the performance of various dynamic query abolishment mechanisms in different unstructured overlay network topologies such as found in several P2P systems. We speci...
Elena Meshkova, Janne Riihijärvi, Petri M&aum...