Sciweavers

4526 search results - page 115 / 906
» Algorithmic problems related to the Internet
Sort
View
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 3 months ago
Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classificatio
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
Peter D. Turney
ICASSP
2011
IEEE
14 years 7 months ago
Convex approximation algorithms for back-pressure power control of wireless multi-hop networks
Cross-layer design and operation of wireless networks has attracted significant interest in the last decade, yet some basic problems in the area remain unsolved. In this paper, w...
Evaggelia Matskani, Nikos D. Sidiropoulos, Leandro...
147
Voted
JMLR
2010
125views more  JMLR 2010»
14 years 11 months ago
Regret Bounds for Gaussian Process Bandit Problems
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
Steffen Grünewälder, Jean-Yves Audibert,...
140
Voted
CADE
2003
Springer
16 years 4 months ago
Certifying Solutions to Permutation Group Problems
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
Arjeh M. Cohen, Scott H. Murray, Martin Pollet, Vo...
ICRA
2009
IEEE
133views Robotics» more  ICRA 2009»
15 years 10 months ago
A stochastically stable solution to the problem of robocentric mapping
Abstract— This paper provides a novel solution for robocentric mapping using an autonomous mobile robot. The robot dynamic model is the standard unicycle model and the robot is a...
Adrian N. Bishop, Patric Jensfelt