Sciweavers

743 search results - page 93 / 149
» Optimal Abstraction on Real-Valued Programs
Sort
View
GECCO
2003
Springer
15 years 3 months ago
What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes
Abstract. This paper provides an empirical test of a hypothesis, which describes the effects of structural mechanisms in genetic programming. In doing so, the paper offers a test p...
Jason M. Daida, Hsiaolei Li, Ricky Tang, Adam M. H...
IVEVA
2004
14 years 11 months ago
Groups and Crowds with behaviors specified in the environment
Abstract. In this paper we describe a system where behavior of characters and groups of characters are determined by assigning attributes to groups and individuals hierarchically a...
Isaac Rudomín, Fernando Perez, Erik Mill&aa...
ANOR
2002
67views more  ANOR 2002»
14 years 9 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith
SOFSEM
2010
Springer
15 years 6 months ago
Source Code Rejuvenation Is Not Refactoring
Programmers rely on programming idioms, design patterns, and workaround techniques to make up for missing programming language support. Evolving languages often address frequently ...
Peter Pirkelbauer, Damian Dechev, Bjarne Stroustru...
IFL
2007
Springer
120views Formal Methods» more  IFL 2007»
15 years 4 months ago
Lazy Contract Checking for Immutable Data Structures
Existing contract checkers for data structures force programmers to choose between poor alternatives. Contracts are either built into the functions that construct the data structur...
Robert Bruce Findler, Shu-yu Guo, Anne Rogers