Sciweavers

1566 search results - page 43 / 314
» Contification Using Dominators
Sort
View
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
15 years 1 months ago
"Optimal" mutation rates for genetic search
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
Jorge Cervantes, Christopher R. Stephens
PODC
2010
ACM
14 years 11 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
AAAI
2004
14 years 11 months ago
Dynamic Programming for Partially Observable Stochastic Games
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilber...
MMNS
2003
113views Multimedia» more  MMNS 2003»
14 years 11 months ago
Secure Inclusion of Phones Into Online E-meetings
Online Internet based e-meetings for synchronous communication is becoming more and more common and the need for secure communication is a strong requirement from both corporate a...
Peter Parnes
NETWORK
2006
96views more  NETWORK 2006»
14 years 9 months ago
Optimizing TCP and RLC interaction in the UMTS radio access network
TCP, the dominant transport protocol for Internet applications, suffers severe performance degradation due to packet losses when a wireless link is present in the endto-end path. ...
Juan J. Alcaraz, Fernando Cerdán, Joan Garc...