5138 search results - page 282 / 1028 » Randomized Algorithms for 3-SAT |
175
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
131
click to vote
ISCAS
2006
IEEE
16 years 18 days ago
2006
IEEE
— In this paper, we describe a simple second-order discrete-time model for the Transmission Control Protocol (TCP) with Random Early Detection (RED) algorithm. The TCP/RED mechan...
137
click to vote
WG
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
157
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. This work introduces a new evolutionary algorithm that adapts the operator probabilities (rates) while evolves the solution of the problem. Each individual encodes its ge...
167
click to vote
MFCS
2004
Springer
15 years 12 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...