Sciweavers

654 search results - page 57 / 131
» Ordered Sets and Complete Lattices
Sort
View
CP
2005
Springer
14 years 1 months ago
Boosting Distributed Constraint Satisfaction
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
Georg Ringwelski, Youssef Hamadi
NETWORKING
2000
13 years 9 months ago
Performance of Short TCP Transfers
Many works have studied the negative impact of slow start on the performance of short transfers. Some works propose to accelerate the window increase during this phase in order to ...
Chadi Barakat, Eitan Altman
ACC
2011
65views more  ACC 2011»
12 years 7 months ago
Measuring the Deployment Hiccups of DNSSEC
On May 5, 2010 the last step of the DNSSEC deployment on the 13 root servers was completed. DNSSEC is a set of security extensions on the traditional DNS protocol, that aim in prev...
Vasilis Pappas, Angelos D. Keromytis
DAGSTUHL
2008
13 years 9 months ago
Uniprocessor EDF Feasibility is an Integer Problem
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Enrico Bini
IJCAI
2007
13 years 9 months ago
Incompleteness and Incomparability in Preference Aggregation
We consider how to combine the preferences of multiple agents despite the presence of incompleteness and incomparability in their preference orderings. An agent’s preference orde...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...