Sciweavers

7228 search results - page 273 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
STACS
2010
Springer
15 years 11 months ago
Exact Covers via Determinants
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
Andreas Björklund
ICC
2007
IEEE
126views Communications» more  ICC 2007»
15 years 10 months ago
Stochastic RED and Its Applications
Abstract— In this paper, we present a novel fair queue management algorithm called Stochastic RED (StoRED), inspired by the well known stochastic fair queuing and based on the ra...
Shan Chen, Zhen Zhou, Brahim Bensaou
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
15 years 10 months ago
Planning with Continuous Actions in Partially Observable Environments
Abstract— We present a simple randomized POMDP algorithm for planning with continuous actions in partially observable environments. Our algorithm operates on a set of reachable b...
Matthijs T. J. Spaan, Nikos A. Vlassis
ISCC
2000
IEEE
112views Communications» more  ISCC 2000»
15 years 9 months ago
RED Behavior with Different Packet Sizes
We consider the adaptation of random early detection (RED) as a buffer management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTUs) are ...
Stefaan De Cnodder, Omar Elloumi, Kenny Pauwels
AAAI
1997
15 years 5 months ago
Tabu Search for SAT
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
Bertrand Mazure, Lakhdar Sais, Éric Gr&eacu...