7228 search results - page 144 / 1446 » From Algorithmic to Subjective Randomness |
131
Voted
STOC
2006
ACM
15 years 9 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
131
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...
147
Voted
ALENEX
2003
15 years 5 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...
156
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
162
click to vote
JAIR
2002
15 years 3 months ago
2002
In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the unif...