Sciweavers

3211 search results - page 538 / 643
» On the Grundy Number of a Graph
Sort
View
EMSOFT
2004
Springer
14 years 2 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
FOCS
2004
IEEE
14 years 26 days ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
AIPS
2007
13 years 11 months ago
Context-Aware Logistic Routing and Scheduling
In context-aware route planning, agents have to plan their route on a common infrastructure in such a way that plans made by other agents are not invalidated, and no conflicts ar...
Adriaan ter Mors, Jonne Zutt, Cees Witteveen
CISIS
2008
IEEE
13 years 11 months ago
Simplified Bluetooth Scatternet Formation Using Maximal Independent Sets
Bluetooth standard allows the creation of piconets, with one node serving as its master and up to seven nodes serving as slaves. A Bluetooth ad hoc network can also be formed by in...
Nejib Zaguia, Ivan Stojmenovic, Yassine Daadaa
CF
2006
ACM
13 years 11 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander