Sciweavers

4114 search results - page 392 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
QEST
2010
IEEE
15 years 4 months ago
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
Ralf Wimmer, Bettina Braitling, Bernd Becker, Erns...
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
15 years 4 months ago
Single step evolution of robot controllers for sequential tasks
The generation of robot controllers for a task requiring a sequence of elementary behaviors is still a challenge. If these behaviors are known, intermediate steps can be given to ...
Stéphane Doncieux, Jean-Baptiste Mouret
JIIS
2010
106views more  JIIS 2010»
15 years 1 months ago
A new classification of datasets for frequent itemsets
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to ...
Frédéric Flouvat, Fabien De Marchi, ...
JMLR
2010
161views more  JMLR 2010»
15 years 1 months ago
Empirical Bernstein Boosting
Concentration inequalities that incorporate variance information (such as Bernstein's or Bennett's inequality) are often significantly tighter than counterparts (such as...
Pannagadatta K. Shivaswamy, Tony Jebara