Sciweavers

8838 search results - page 336 / 1768
» Generalizing Domain Theory
Sort
View
147
Voted
QSIC
2005
IEEE
16 years 10 days ago
Test Case Generation by OCL Mutation and Constraint Solving
Fault-based testing is a technique where testers anticipate errors in a system under test in order to assess or generate test cases. The idea is to have enough test cases capable ...
Bernhard K. Aichernig, Percy Antonio Pari Salas
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
16 years 9 days ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
COSIT
1999
Springer
118views GIS» more  COSIT 1999»
15 years 11 months ago
Agglomerations
Where some have attempted to apply cognitive methods to the study of geography, the present paper is designed to serve as a starting point for applying methods of geographic ontolo...
Barry Smith
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 10 months ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli
EUROGP
2007
Springer
171views Optimization» more  EUROGP 2007»
15 years 8 months ago
Geometric Particle Swarm Optimisation
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Cecilia Di Chio, Riccardo Poli