5889 search results - page 847 / 1178 » Graph Layout Problems |
185
Voted
PPSN
2004
Springer
16 years 23 days ago
2004
Springer
The investigation of evolutionary algorithms as adaptation schemes has a long history starting with Holland (1975). The Ising model from physics leads to a variety of different pr...
168
click to vote
SAS
2004
Springer
16 years 23 days ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
170
click to vote
ACSAC
2003
IEEE
16 years 21 days ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
157
Voted
FOCS
2003
IEEE
16 years 21 days ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
194
Voted
FOCS
2002
IEEE
16 years 11 days ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...