Sciweavers

3937 search results - page 673 / 788
» Questioning Ubiquitous Computing
Sort
View
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
13 years 6 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha
COLT
2010
Springer
13 years 6 months ago
Efficient Classification for Metric Data
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as ...
Lee-Ad Gottlieb, Leonid Kontorovich, Robert Krauth...
EVOW
2010
Springer
13 years 6 months ago
Coevolutionary Dynamics of Interacting Species
One of the open questions in evolutionary computation is how an arms race may be initiated between coevolving entities such that the entities acquire new behaviors and increase in ...
Marc Ebner, Richard A. Watson, Jason Alexander
FSTTCS
2010
Springer
13 years 6 months ago
Finding Independent Sets in Unions of Perfect Graphs
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
IAT
2010
IEEE
13 years 6 months ago
Nash Welfare Allocation Problems: Concrete Issues
The allocation of m resources between n agents is an AI problem with a great practical interest for automated trading. The general question is how to configure the behavior of barg...
Antoine Nongaillard, Philippe Mathieu, Patricia Ev...