Sciweavers

450 search results - page 44 / 90
» Adaptive Algorithms for Online Decision Problems
Sort
View
117
Voted
AAAI
2007
15 years 5 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
202
Voted
CVPR
2010
IEEE
15 years 11 months ago
Curious Snakes: a minimum-latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embe...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony Yez...
217
Voted
CVPR
2010
IEEE
15 years 5 days ago
Curious snakes: A minimum latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony J. ...
133
Voted
VLDB
2002
ACM
141views Database» more  VLDB 2002»
15 years 3 months ago
A Multi-version Cache Replacement and Prefetching Policy for Hybrid Data Delivery Environments
This paper introduces MICP, a novel multiversion integrated cache replacement and prefetching algorithm designed for efficient cache and transaction management in hybrid data deli...
André Seifert, Marc H. Scholl
149
Voted
GECCO
2006
Springer
186views Optimization» more  GECCO 2006»
15 years 7 months ago
Genetic algorithms for action set selection across domains: a demonstration
Action set selection in Markov Decision Processes (MDPs) is an area of research that has received little attention. On the other hand, the set of actions available to an MDP agent...
Greg Lee, Vadim Bulitko