5153 search results - page 228 / 1031 » Introduction to Randomized Algorithms |
129
click to vote
ICRA
2002
IEEE
15 years 8 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
115
click to vote
CP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
130
click to vote
EMNLP
2006
15 years 4 months ago
2006
Markov order-1 conditional random fields (CRFs) and semi-Markov CRFs are two popular models for sequence segmentation and labeling. Both models have advantages in terms of the typ...
146
Voted
ALENEX
2003
15 years 4 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
115
Voted
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...