Sciweavers

4103 search results - page 43 / 821
» Some results on the Collatz problem
Sort
View
ANOR
2002
47views more  ANOR 2002»
14 years 11 months ago
Nonparametric Adverse Selection Problems
This article is devoted to adverse selection problems in which individual private information is a whole utility function and cannot be reduced to some finite-dimensional parameter...
Guillaume Carlier
APN
2006
Springer
15 years 3 months ago
The Synthesis Problem of Netcharts
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
Nicolas Baudru, Rémi Morin
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
15 years 1 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
AIPS
2008
15 years 2 months ago
In Search of the Tractability Boundary of Planning Problems
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
Omer Giménez, Anders Jonsson
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
15 years 27 days ago
A new memetic strategy for the numerical treatment of multi-objective optimization problems
In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry o...
Oliver Schütze, Gustavo Sanchez, Carlos A. Co...