Sciweavers

312 search results - page 11 / 63
» An experimental study on algorithms for drawing binary trees
Sort
View
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
13 years 8 months ago
Optinformatics for schema analysis of binary genetic algorithms
Given the importance of optimization and informatics which are the two broad fields of research, we present an instance of Optinformatics which denotes the specialization of info...
Minh Nghia Le, Yew-Soon Ong, Quang Huy Nguyen 0001
DAC
2003
ACM
14 years 8 months ago
Automated synthesis of efficient binary decoders for retargetable software toolkits
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
Wei Qin, Sharad Malik
SAC
2004
ACM
14 years 27 days ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha
CPAIOR
2006
Springer
13 years 11 months ago
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellma...
MMNS
2003
102views Multimedia» more  MMNS 2003»
13 years 8 months ago
A Heuristic Algorithm for the Multi-constrained Multicast Tree
Multicasting is an important communication mechanism for implementing real-time multimedia applications, which usually require the underlying network to provide a number of quality...
Wen-Lin Yang