Sciweavers

792 search results - page 6 / 159
» Finding Cost-Efficient Adapters
Sort
View
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 4 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
IJMMS
2008
68views more  IJMMS 2008»
14 years 9 months ago
Mobile technologies in mobile spaces: Findings from the context of train travel
Whilst mobile work is increasingly prevalent, there is little detailed study of this phenomenon in the specific context of a train. Thus, the current study focuses on how mobile w...
Carolyn M. Axtell, Donald Hislop, Steve Whittaker
CIRA
2007
IEEE
128views Robotics» more  CIRA 2007»
15 years 3 months ago
Using Heuristic Search To Find Stable High-Order Single-Bit Delta Sigma Modulators
— A heuristic search for stable high-order delta sigma modulators is presented. Searches guided by the Linear Model found stable modulators with higher SNR performance compared t...
Ståle Andreas Skogstad, Mats Erling Hø...
ISAAC
1993
Springer
87views Algorithms» more  ISAAC 1993»
15 years 1 months ago
Finding the Shortest Watchman Route in a Simple Polygon
We present the first polynomial time algorithm that finds the shortest route in a simple polygon such that all points of the polygon are visible from the route. This route is cal...
Svante Carlsson, Håkan Jonsson, Bengt J. Nil...
BMVC
2001
14 years 12 months ago
Finding Paths in Video Sequences
This paper investigates the task of identifying frequently-used pathways from video sequences of natural outdoor scenes. Path models are adaptively learnt from the accumulation of...
Dimitrios Makris, Tim Ellis