Sciweavers

2244 search results - page 89 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
ANOR
2011
117views more  ANOR 2011»
14 years 9 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
AI
1999
Springer
15 years 5 months ago
Learning by Discovering Concept Hierarchies
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
Blaz Zupan, Marko Bohanec, Janez Demsar, Ivan Brat...
ICCAD
1999
IEEE
132views Hardware» more  ICCAD 1999»
15 years 10 months ago
The associative-skew clock routing problem
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative ...
Yu Chen, Andrew B. Kahng, Gang Qu, Alexander Zelik...
ICALP
2005
Springer
15 years 11 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
JSW
2008
123views more  JSW 2008»
15 years 6 months ago
Component-oriented Reliability Analysis and Optimal Version-upgrade Problems for Open Source Software
The current software development environment has been changing into new development paradigms such as concurrent distributed development environment and the so-called open source p...
Yoshinobu Tamura, Shigeru Yamada