Sciweavers

5580 search results - page 390 / 1116
» Randomized priority algorithms
Sort
View
CP
2006
Springer
15 years 11 months ago
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Matthew J. Streeter, Stephen F. Smith
223
Voted
NIL
1991
15 years 11 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass
JTRES
2010
ACM
15 years 7 months ago
Exhaustive testing of safety critical Java
With traditional testing, the test case has no control over non-deterministic scheduling decisions, and thus errors dependent on scheduling are only found by pure chance. Java Pat...
Tomás Kalibera, Pavel Parizek, Michal Maloh...
174
Voted
TKDE
2008
115views more  TKDE 2008»
15 years 7 months ago
Time-Aware Web Users' Clustering
Web users clustering is a crucial task for mining information related to users needs and preferences. Up to now, popular clustering approaches build clusters based on usage pattern...
Sophia G. Petridou, Vassiliki A. Koutsonikola, Ath...
210
Voted
AROBOTS
1998
100views more  AROBOTS 1998»
15 years 7 months ago
Interleaving Planning and Robot Execution for Asynchronous User Requests
Rogue is an architecture built on a real robot which provides algorithms for the integration of highlevel planning, low-level robotic execution, and learning. Rogue addresses succ...
Karen Zita Haigh, Manuela M. Veloso