Sciweavers

1749 search results - page 286 / 350
» Logic, Optimization, and Constraint Programming
Sort
View
TCAD
2008
97views more  TCAD 2008»
13 years 7 months ago
Encoding Large Asynchronous Controllers With ILP Techniques
State encoding is one of the most difficult problems in the synthesis of asynchronous controllers. This paper presents a method that can solve the problem of large controllers spec...
Josep Carmona, Jordi Cortadella
TEC
2002
94views more  TEC 2002»
13 years 7 months ago
Knowledge-intensive genetic discovery in foreign exchange markets
Abstract--This paper considers the discovery of trading decision models from high-frequency foreign exchange (FX) markets data using genetic programming (GP). It presents a domain-...
Siddhartha Bhattacharyya, Olivier V. Pictet, Gille...
PLDI
2009
ACM
14 years 2 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
13 years 11 months ago
A dynamically constrained genetic algorithm for hardware-software partitioning
In this article, we describe the application of an enhanced genetic algorithm to the problem of hardware-software codesign. Starting from a source code written in a high-level lan...
Pierre-André Mudry, Guillaume Zufferey, Gia...
CORR
2007
Springer
77views Education» more  CORR 2007»
13 years 7 months ago
On the interaction between sharing and linearity
nalysis of logic programs, abstract domains for detecting sharing and linearity ion are widely used. Devising abstract unification algorithms for such domains has proved to be ra...
Gianluca Amato, Francesca Scozzari