Sciweavers

1242 search results - page 102 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
CORR
2006
Springer
148views Education» more  CORR 2006»
14 years 10 months ago
Budget Optimization in Search-Based Advertising Auctions
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
Jon Feldman, S. Muthukrishnan, Martin Pál, ...
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
15 years 4 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
ESM
1998
14 years 11 months ago
On Hybrid Combination of Queueing and Simulation
This paper aims to and illustrate that simulation and queuing theory can and should go hand in hand for a variety of practical problems, both in daily-life and industry, which are...
Nico M. van Dijk
CACM
1998
103views more  CACM 1998»
14 years 9 months ago
The Virtual Design Team
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
John C. Kunz, Tore R. Christiansen, Geoff P. Cohen...
APAL
2005
119views more  APAL 2005»
14 years 10 months ago
Elementary arithmetic
Abstract. There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion (1992) can be imposed on arithmetical theories like PA: quantify over...
Geoffrey E. Ostrin, Stanley S. Wainer