Sciweavers

1749 search results - page 123 / 350
» Logic, Optimization, and Constraint Programming
Sort
View
GECCO
1999
Springer
14 years 16 days ago
Large Populations Are Not Always The Best Choice In Genetic Programming
In genetic programming a general consensus is that the population should be as large as practically possible or sensible. In this paper we examine a batch of problems of combinato...
Matthias Fuchs
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 8 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
DATE
2010
IEEE
120views Hardware» more  DATE 2010»
14 years 1 months ago
Linear programming approach for performance-driven data aggregation in networks of embedded sensors
Abstract—Cyber Physical Systems are distributed systemsof-systems that integrate sensing, processing, networking and actuation. Aggregating physical data over space and in time e...
Cristian Ferent, Varun Subramanian, Michael Gilber...
EUROGP
2008
Springer
128views Optimization» more  EUROGP 2008»
13 years 10 months ago
Hardware Accelerators for Cartesian Genetic Programming
A new class of FPGA-based accelerators is presented for Cartesian Genetic Programming (CGP). The accelerators contain a genetic engine which is reused in all applications. Candidat...
Zdenek Vasícek, Lukás Sekanina
CP
2005
Springer
14 years 1 months ago
Incremental Algorithms for Local Search from Existential Second-Order Logic
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
Magnus Ågren, Pierre Flener, Justin Pearson