Sciweavers

364 search results - page 40 / 73
» Generalized normal forms and polynomial system solving
Sort
View
SSS
2010
Springer
158views Control Systems» more  SSS 2010»
14 years 8 months ago
Low Memory Distributed Protocols for 2-Coloring
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
Amos Israeli, Mathew D. McCubbins, Ramamohan Patur...
SAC
2006
ACM
15 years 3 months ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
15 years 6 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
15 years 3 months ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
FLAIRS
2009
14 years 7 months ago
Advanced Measures for Empirical Testing
Empirical testing is a very popular evaluation method for the development of intelligent systems. Here, previously solved problems with correct solutions are given as cases to the...
Joachim Baumeister