952 search results - page 119 / 191 » Computational complexity of stochastic programming problems |
137
Voted
HUMAN
2003
Springer
15 years 8 months ago
2003
Springer
Auctions have become popular in conducting trade negotiations on the Internet. The design of new auction formats and other negotiation protocols has become an important topic for r...
255
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
162
click to vote
JMLR
2008
15 years 3 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
137
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
This paper describes a framework for providing the ability to use multiple specialized data parallel libraries and/or languages within a single application. The ability to use mul...
130
click to vote
CHI
2007
ACM
15 years 7 months ago
2007
ACM
Software developers must modify their programs to keep up with changing requirements and designs. Often, a conceptually simple change can require numerous edits that are similar b...