Sciweavers

708 search results - page 29 / 142
» Timing closure: the solution and its problems
Sort
View
SSD
2001
Springer
122views Database» more  SSD 2001»
15 years 2 months ago
Calendars, Time Granularities, and Automata
The notion of time granularity comes into play in a variety of problems involving time representation and management in database applications, including temporal database design, t...
Ugo Dal Lago, Angelo Montanari
EH
2004
IEEE
107views Hardware» more  EH 2004»
15 years 1 months ago
Evolving Digital Circuits using Multi Expression Programming
Multi Expression Programming (MEP) is a Genetic Programming (GP) variant that uses linear chromosomes for solution encoding. A unique MEP feature is its ability of encoding multipl...
Mihai Oltean, Crina Grosan
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
15 years 3 months ago
Learning Environment for Life Time Value Calculation of Customers in Insurance Domain
A critical success factor in Insurance business is its ability to use information sources and contained knowledge in the most effective way. Its profitability is obtained through t...
Andrea Tettamanzi, Luca Sammartino, Mikhail Simono...
GECCO
2006
Springer
163views Optimization» more  GECCO 2006»
15 years 1 months ago
The quadratic multiple knapsack problem and three heuristic approaches to it
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
Amanda Hiley, Bryant A. Julstrom
ANOR
2011
117views more  ANOR 2011»
14 years 1 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