2911 search results - page 337 / 583 » A Logic of Graph Constraints |
179
click to vote
SAC
2000
ACM
15 years 11 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
187
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
151
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
192
click to vote
VISSYM
2003
15 years 8 months ago
2003
A high-level approach to describe the characteristics of a surface is to segment it into regions of uniform curehavior and construct an abstract representation given by a (topolog...
222
click to vote
SIROCCO
1997
15 years 8 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...