1972 search results - page 373 / 395 » Evolutionary algorithms and dynamic programming |
ISSAC
2007
Springer
15 years 5 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
ICMCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Modern mobile devices are multi-homed with WLAN and WWAN communication interfaces. In a community of nodes with such multihomed devices — locally inter-connected via high-speed ...
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
109
click to vote
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
102
click to vote
STOC
1999
ACM
15 years 4 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...