113 search results - page 10 / 23 » Combinatorial Flag Varieties |
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper uses under-approximation of unreachable states of a design to derive incomplete specification of combinational logic. The resulting incompletely-specified functions are...
118
Voted
EVOW
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
ICICIC
2006
IEEE
15 years 3 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
WG
2005
Springer
15 years 2 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
106
click to vote
AMEC
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We provide a formal scripting language to capture the semantics of market mechanisms. The language is based on a set of welldefined principles, and is designed to captur...