Sciweavers

6833 search results - page 229 / 1367
» Some two-character sets
Sort
View
EOR
2011
140views more  EOR 2011»
14 years 10 months ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
ATAL
2011
Springer
14 years 6 months ago
Reasoning about local properties in modal logic
In modal logic, when adding a syntactic property to an axiomatisation, this property will semantically become true in all models, in all situations, under all circumstances. For i...
Hans P. van Ditmarsch, Wiebe van der Hoek, Barteld...
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
13 years 9 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
TKDE
2012
487views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...
Rajeev Gupta, Krithi Ramamritham
ICIP
2005
IEEE
16 years 8 months ago
Sampling in practice: is the best reconstruction space bandlimited?
Shannon's sampling theory and its variants provide effective solutions to the problem of reconstructing a signal from its samples in some "shift-invariant " space, ...
Sathish Ramani, Dimitri Van De Ville, Michael Unse...