Sciweavers

1174 search results - page 159 / 235
» Optimizing generics is easy!
Sort
View
INFOCOM
2009
IEEE
15 years 6 months ago
Graceful Network Operations
—A significant fraction of network events (such as topology or route changes) and the resulting performance degradation stem from premeditated network management and operational...
Saqib Raza, Yuanchen Zhu, Chen-Nee Chuah
NETCOOP
2007
Springer
15 years 6 months ago
How Expensive Is Link Utilization?
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in unde...
Rade Stanojevic, Robert Shorten
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 3 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
AI
2010
Springer
15 years 8 hour ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
EDBT
1990
ACM
108views Database» more  EDBT 1990»
15 years 3 months ago
Deductive Databases - Theory Meets Practice
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
Carlo Zaniolo