Sciweavers

1312 search results - page 7 / 263
» Formally Optimal Boxing
Sort
View
GECCO
2009
Springer
114views Optimization» more  GECCO 2009»
14 years 11 days ago
Noiseless functions black-box optimization: evaluation of a hybrid particle swarm with differential operators
In this work we evaluate a Particle Swarm Optimizer hybridized with Differential Evolution and apply it to the BlackBox Optimization Benchmarking for noiseless functions (BBOB 20...
José García-Nieto, Enrique Alba, Jav...
VL
1990
IEEE
110views Visual Languages» more  VL 1990»
13 years 11 months ago
A Declarative Formalism for Specifying Graphical Layout
This paper describes a new approach to specifying graphical layouts of arbitrary objects, which is based on a TEXlike notation. Our simplest scheme offers specifications similar t...
Volker Haarslev, Ralf Möller
COMPOS
1997
Springer
13 years 12 months ago
Compositional Refinement of Interactive Systems Modelled by Relations
We introduce a mathematical model of components that can be used for the description of both hardware and software units forming distributed interactive systems. As part of a distr...
Manfred Broy
RECSYS
2009
ACM
14 years 2 months ago
Getting recommender systems to think outside the box
We examine the case of over-specialization in recommender systems, which results from returning items that are too similar to those previously rated by the user. We propose Outsid...
Zeinab Abbassi, Sihem Amer-Yahia, Laks V. S. Laksh...
ICCAD
2007
IEEE
107views Hardware» more  ICCAD 2007»
14 years 4 months ago
Computation of minimal counterexamples by using black box techniques and symbolic methods
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...
Tobias Nopper, Christoph Scholl, Bernd Becker