Sciweavers

206 search results - page 24 / 42
» Three Hoppy path problems and ternary paths
Sort
View
IPPS
2003
IEEE
14 years 26 days ago
Performance Analysis of Distributed Search in Open Agent Systems
In open multi-agent systems agents need resources provided by other agents but they are not aware of which agents provide the particular resources. Most solutions to this problem ...
Vassilios V. Dimakopoulos, Evaggelia Pitoura
CGO
2003
IEEE
13 years 11 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue
INFOCOM
2006
IEEE
14 years 1 months ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang
STACS
2010
Springer
14 years 2 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
HCI
2009
13 years 5 months ago
Context-Aware Cognitive Agent Architecture for Ambient User Interfaces
An ambient user interface is a set of hidden intelligent interfaces that recognize user's presence and provides services to immediate needs. There are several research activit...
Youngho Lee, Choonsung Shin, Woontack Woo