952 search results - page 74 / 191 » Computational complexity of stochastic programming problems |
123
click to vote
ICMAS
2000
15 years 1 months ago
2000
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
108
click to vote
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
117
click to vote
ACTAC
2006
15 years 20 days ago
2006
The surgery of fractured bones is often a very complex problem. That is the reason why it would be beneficial to create a geometric and mechanic model of the bones before surgical...
126
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...