Sciweavers

936 search results - page 117 / 188
» The Synthesis Problem of Netcharts
Sort
View
128
Voted
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
15 years 9 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
152
Voted
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
15 years 9 months ago
Towards identifying populations that increase the likelihood of success in genetic programming
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
Jason M. Daida
111
Voted
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 9 months ago
Preventing overfitting in GP with canary functions
Overfitting is a fundamental problem of most machine learning techniques, including genetic programming (GP). Canary functions have been introduced in the literature as a concept ...
Nate Foreman, Matthew P. Evett
119
Voted
DAC
1995
ACM
15 years 7 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
116
Voted
AAAI
1997
15 years 4 months ago
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
Roberto J. Bayardo Jr., Robert Schrag