Sciweavers

5263 search results - page 780 / 1053
» Open Constraint Optimization
Sort
View
WINE
2010
Springer
251views Economy» more  WINE 2010»
15 years 5 months ago
The Complexity of Equilibria in Cost Sharing Games
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
Vasilis Syrgkanis
ICC
2009
IEEE
161views Communications» more  ICC 2009»
15 years 5 months ago
Energy-Efficient Itinerary Planning for Mobile Agents in Wireless Sensor Networks
Compared to conventional wireless sensor networks (WSNs) that are operated based on the client-server computing model, mobile agent (MA) systems provide new capabilities for energy...
Min Chen, Victor C. M. Leung, Shiwen Mao, Taekyoun...
ASIACRYPT
2010
Springer
15 years 4 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
CORR
2010
Springer
231views Education» more  CORR 2010»
15 years 4 months ago
Delay-Based Back-Pressure Scheduling in Multi-Hop Wireless Networks
Scheduling is a critical and challenging resource allocation mechanism for multi-hop wireless networks. It is well known that scheduling schemes that give a higher priority to the ...
Bo Ji, Changhee Joo, Ness B. Shroff
IJACTAICIT
2010
123views more  IJACTAICIT 2010»
15 years 4 months ago
A Hybrid Fault-Proneness Detection Approach Using Text Filtering and Static Code Analysis
We have proposed a fault-prone software module detection method using text-filtering approach, called Fault-proneness filtering. Even though the fault-proneness filtering achieved...
Osamu Mizuno, Hideaki Hata