5138 search results - page 361 / 1028 » Randomized Algorithms for 3-SAT |
157
click to vote
AE
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for...
201
Voted
STACS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
186
click to vote
FSTTCS
2004
Springer
16 years 2 days ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
201
click to vote
AUSAI
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
171
click to vote
SBRN
2000
IEEE
15 years 11 months ago
2000
IEEE
d Articles >> Table of Contents >> Abstract VI Brazilian Symposium on Neural Networks (SBRN'00) p. 24 Adaptation of Parameters of BP Algorithm Using Automata Hamid...