Sciweavers

2864 search results - page 403 / 573
» Constraint Programming in OPL
Sort
View
CPAIOR
2008
Springer
13 years 11 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 9 months ago
A Truthful Mechanism for Offline Ad Slot Scheduling
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constr...
Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, M...
MP
2002
195views more  MP 2002»
13 years 8 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
ICC
2008
IEEE
175views Communications» more  ICC 2008»
14 years 3 months ago
Routing in Cooperative Wireless Networks with Mutual-Information Accumulation
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
Stark C. Draper, Lingjia Liu, Andreas F. Molisch, ...
PADL
2004
Springer
14 years 2 months ago
Symbolic Execution of Behavioral Requirements
Message Sequence Charts (MSC) have traditionally been used as a weak form of behavioral requirements in software design; they denote scenarios which may happen. Live Sequence Chart...
Tao Wang, Abhik Roychoudhury, Roland H. C. Yap, S....