Sciweavers

8825 search results - page 1500 / 1765
» All for one or one for all
Sort
View
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 3 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
DOLAP
2005
ACM
15 years 3 months ago
Applying MDA to the development of data warehouses
Different modeling approaches have been proposed to overcome every design pitfall of the development of the different parts of a data warehouse (DW) system. However, they are all ...
Jose-Norberto Mazón, Juan Trujillo, Manuel ...
COMPGEOM
2008
ACM
15 years 3 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
CONEXT
2008
ACM
15 years 3 months ago
Observing slow crustal movement in residential user traffic
It is often argued that rapidly increasing video content along with the penetration of high-speed access is leading to explosive growth in the Internet traffic. Contrary to this p...
Kenjiro Cho, Kensuke Fukuda, Hiroshi Esaki, Akira ...
CP
2008
Springer
15 years 3 months ago
An Application of Constraint Programming to Superblock Instruction Scheduling
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
Abid M. Malik, Michael Chase, Tyrel Russell, Peter...
« Prev « First page 1500 / 1765 Last » Next »