Sciweavers

1361 search results - page 91 / 273
» Boolean Comparison by Simulation
Sort
View
AAAI
2008
13 years 10 months ago
Generating Application-Specific Benchmark Models for Complex Systems
Automated generators for synthetic models and data can play a crucial role in designing new algorithms/modelframeworks, given the sparsity of benchmark models for empirical analys...
Jun Wang, Gregory M. Provan
CP
2010
Springer
13 years 6 months ago
Local Consistency and SAT-Solvers
In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hy...
Justyna Petke, Peter Jeavons
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 4 months ago
Binary is Good: A Binary Inference Framework for Primary User Separation in Cognitive Radio Networks
Primary users (PU) separation concerns with the issues of distinguishing and characterizing primary users in cognitive radio (CR) networks. We argue the need for PU separation in t...
Huy Anh Nguyen, Rong Zheng, Zhu Han
CEC
2007
IEEE
14 years 2 months ago
A study on application of fitness inference method to PC-IGA
— This paper applies the fitness inference method to Interactive Genetic Algorithm based on Paired Comparison (PC-IGA). PC-IGA enables users to reduce the mental burden for eval...
Yoshinobu Watanabe, Tomohiro Yoshikawa, Takeshi Fu...
CSR
2010
Springer
14 years 28 days ago
Balancing Bounded Treewidth Circuits
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Maurice Jansen, Jayalal M. N. Sarma