Sciweavers

2725 search results - page 527 / 545
» Constraint Solving for Interpolation
Sort
View
IPPS
2000
IEEE
14 years 2 months ago
A General Parallel Simulated Annealing Library and its Application in Airline Industry
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
Georg Kliewer, Stefan Tschöke
ICLP
1999
Springer
14 years 2 months ago
Logic Programming in Oz with Mozart
Oz is a multiparadigm language that supports logic programming as one of its major paradigms. A multiparadigm language is designed to support different programming paradigms (log...
Peter Van Roy
KDD
1999
ACM
220views Data Mining» more  KDD 1999»
14 years 2 months ago
Efficient Mining of Emerging Patterns: Discovering Trends and Differences
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
Guozhu Dong, Jinyan Li
ICCAD
1997
IEEE
69views Hardware» more  ICCAD 1997»
14 years 2 months ago
Speeding up technology-independent timing optimization by network partitioning
Technology-independenttimingoptimizationis animportantproblem in logic synthesis. Although many promising techniques have been proposed in the past, unfortunately they are quite s...
Rajat Aggarwal, Rajeev Murgai, Masahiro Fujita
COMPGEOM
1992
ACM
14 years 1 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl