Sciweavers

64 search results - page 6 / 13
» Compiler-Directed I O Optimization
Sort
View
APNOMS
2006
Springer
13 years 11 months ago
"P4L": A Four Layers P2P Model for Optimizing Resources Discovery and Localization
Peer-to-Peer systems are based on the concept of resources localization and mutualization in dynamic context. In specific environment such as mobile networks, characterized by high...
Mourad Amad, Ahmed Meddahi
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
14 years 1 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
STOC
2000
ACM
134views Algorithms» more  STOC 2000»
13 years 12 months ago
Computing the median with uncertainty
We consider a new model for computing with uncertainty. It is desired to compute a function fX1; : : : ; Xn where X1; : : : ; Xn are unknown, but guaranteed to lie in speci ed i...
Tomás Feder, Rajeev Motwani, Rina Panigrahy...
GECCO
2010
Springer
212views Optimization» more  GECCO 2010»
14 years 8 days ago
Generative and developmental systems
This paper argues that multiagent learning is a potential “killer application” for generative and developmental systems (GDS) because key challenges in learning to coordinate ...
Kenneth O. Stanley
INFOCOM
2008
IEEE
14 years 1 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu