Sciweavers

9842 search results - page 1687 / 1969
» Problem complexity
Sort
View
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
15 years 7 months ago
Evolutionary path planner for UAVs in realistic environments
This paper presents a path planner for Unmanned Air Vehicles (UAVs) based on Evolutionary Algorithms (EA) that can be used in realistic risky scenarios. The path returned by the a...
Jesús Manuel de la Cruz, Eva Besada-Portas,...
GRID
2008
Springer
15 years 7 months ago
Dynamic scheduling for heterogeneous Desktop Grids
Desktop Grids have emerged as an important methodology to harness the idle cycles of millions of participant desktop PCs over the Internet. However, to effectively utilize the res...
Issam Al-Azzoni, Douglas G. Down
195
Voted
ICML
2010
IEEE
15 years 7 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
RECSYS
2010
ACM
15 years 6 months ago
Recommending based on rating frequencies
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
Fatih Gedikli, Dietmar Jannach
SIGCOMM
2010
ACM
15 years 6 months ago
Achieving O(1) IP lookup on GPU-based software routers
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
Jin Zhao, Xinya Zhang, Xin Wang, Xiangyang Xue
« Prev « First page 1687 / 1969 Last » Next »