3220 search results - page 515 / 644 » Constrained Graph Processes |
165
Voted
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
191
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents a novel approach to solve the constrained unit commitment problem using Selective Self-Adaptive Ant System (SSAS) for improving search performance by automatic...
200
click to vote
CHI
1995
ACM
15 years 10 months ago
1995
ACM
The Modeler is designed using a learner-centered approach [5], with scaffolding to address the specific needs of learners. Scaffolding [3] is an educational term that refers to pro...
214
click to vote
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
Online Analytical Processing (OLAP) is a popular technique for explorative data analysis. Usually, a fixed set of dimensions (such as time, place, etc.) is used to explore and ana...
209
click to vote
DEBS
2009
ACM
15 years 10 months ago
2009
ACM
Streaming data models have been shown to be useful in many applications requiring high-performance data exchange. Application-level overlay networks are a natural way to realize t...