Sciweavers

1265 search results - page 160 / 253
» Finding the Key to a Synapse
Sort
View
ENTCS
2006
113views more  ENTCS 2006»
13 years 9 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
EOR
2006
118views more  EOR 2006»
13 years 9 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
GC
2006
Springer
13 years 9 months ago
The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
Linfan Mao, Yanpei Liu, Erling Wei
CII
2007
88views more  CII 2007»
13 years 9 months ago
Benefits of an item-centric enterprise-data model in logistics services: A case study
The paper uses a case example to present a novel way of building enterprise information systems. The objective is to bring forth the benefits of an item centric systems design in ...
Mikko Rönkkö, Mikko Kärkkäinen...
CN
2007
97views more  CN 2007»
13 years 9 months ago
A longest prefix first search tree for IP lookup
- One of the key design issues for IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a lon...
Lih-Chyau Wuu, Tzong-Jye Liu, Kuo-Ming Chen