Sciweavers

9810 search results - page 1655 / 1962
» Problems, Descriptions and Objects
Sort
View
ITNG
2007
IEEE
16 years 1 months ago
Computational Power of the Quantum Turing Automata
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuh...
KBSE
2007
IEEE
16 years 1 months ago
Scalable automatic test data generation from modeling diagrams
We explore the automatic generation of test data that respect constraints expressed in the Object-Role Modeling (ORM) language. ORM is a popular conceptual modeling language, prim...
Yannis Smaragdakis, Christoph Csallner, Ranjith Su...
GECCO
2007
Springer
200views Optimization» more  GECCO 2007»
16 years 26 days ago
Adaptive variance scaling in continuous multi-objective estimation-of-distribution algorithms
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
Peter A. N. Bosman, Dirk Thierens
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
16 years 26 days ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
RTA
2007
Springer
16 years 25 days ago
The Termination Competition
The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades seve...
Claude Marché, Hans Zantema
« Prev « First page 1655 / 1962 Last » Next »