Sciweavers

277 search results - page 23 / 56
» New results on shortest paths in three dimensions
Sort
View
SEMWEB
2007
Springer
14 years 1 months ago
Change Paths in Reasoning!
Millions of research funding has been put down to develop - what I call - old forms - of reasoning that are characterized by strong focus on theoretical properties and strict adher...
Raphael Volz
ICCV
2007
IEEE
14 years 9 months ago
Novel Depth Cues from Uncalibrated Near-field Lighting
We present the first method to compute depth cues from images taken solely under uncalibrated near point lighting. A stationary scene is illuminated by a point source that is move...
Sanjeev J. Koppal, Srinivasa G. Narasimhan
SIGCSE
2002
ACM
172views Education» more  SIGCSE 2002»
13 years 7 months ago
Simulation of load balancing algorithms: a comparative study
This article introduces a new load balancing algorithm, called diffusive load balancing, and compares its performance with three other load balancing algorithms: static, round rob...
Milan E. Soklic
AAAI
2000
13 years 9 months ago
Collective Intelligence and Braess' Paradox
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
Kagan Tumer, David Wolpert
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
13 years 7 months ago
I/O-Efficient Planar Separators
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
Anil Maheshwari, Norbert Zeh