Sciweavers

639 search results - page 80 / 128
» Integer Programming Models for Optimization Problems in Test...
Sort
View
GECCO
2005
Springer
100views Optimization» more  GECCO 2005»
15 years 8 months ago
Evolutionary tree genetic programming
We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...
Ján Antolík, William H. Hsu
140
Voted
IPPS
1998
IEEE
15 years 6 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
162
Voted
VEE
2005
ACM
143views Virtualization» more  VEE 2005»
15 years 8 months ago
Optimized interval splitting in a linear scan register allocator
We present an optimized implementation of the linear scan register allocation algorithm for Sun Microsystems’ Java HotSpotTM client compiler. Linear scan register allocation is ...
Christian Wimmer, Hanspeter Mössenböck
ICCAD
2005
IEEE
144views Hardware» more  ICCAD 2005»
15 years 11 months ago
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
Paulo F. Flores, José C. Monteiro, Eduardo ...
AAAI
2004
15 years 4 months ago
Effective Approaches for Partial Satisfaction (Over-Subscription) Planning
In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a sub...
Menkes van den Briel, Romeo Sanchez Nigenda, Minh ...