Sciweavers

4403 search results - page 233 / 881
» Galois Theory of Algorithms
Sort
View
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
16 years 1 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella
AUTONOMICS
2009
ACM
16 years 1 months ago
Sensor Selection for IT Infrastructure Monitoring
Supervisory control is the main means to assure a high level performance and availability of large IT infrastructures. Applied control theory is used in physical and virtualization...
Gergely János Paljak, Imre Kocsis, Zolt&aac...
CSCLP
2007
Springer
16 years 23 days ago
Generalizing Global Constraints Based on Network Flows
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan
MOBIWAC
2006
ACM
16 years 17 days ago
Quick convergecast in ZigBee/IEEE 802.15.4 tree-based wireless sensor networks
Convergecast is a fundamental operation in wireless sensor networks. Existing convergecast solutions have focused on reducing latency and energy consumption. However, a good desig...
Yu-Chee Tseng, Meng-Shiuan Pan
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 8 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter