Sciweavers

580 search results - page 62 / 116
» Choosing a random peer
Sort
View
AAAI
2008
15 years 2 months ago
Feature Selection for Activity Recognition in Multi-Robot Domains
In multi-robot settings, activity recognition allows a robot to respond intelligently to the other robots in its environment. Conditional random fields are temporal models that ar...
Douglas L. Vail, Manuela M. Veloso
EJC
2007
14 years 11 months ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
JUCS
2006
114views more  JUCS 2006»
14 years 11 months ago
Pseudorandom Number Generation: Impossibility and Compromise
Abstract: Pseudorandom number generators are widely used in the area of simulation. Defective generators are still widely used in standard library programs, although better pseudor...
Makoto Matsumoto, Mutsuo Saito, Hiroshi Haramoto, ...
NOMS
2010
IEEE
147views Communications» more  NOMS 2010»
14 years 10 months ago
Distributed approaches to S-CSCF selection in an IMS network
—The IP Multimedia Subsystem (IMS) is a generic open-systems architecture offering converged multimedia services over IP. A function in the signaling plane of an IMS network is t...
Plarent Tirana, Deep Medhi
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
13 years 11 months ago
On Variants of the Matroid Secretary Problem
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
Shayan Oveis Gharan, Jan Vondrák