Sciweavers

3359 search results - page 409 / 672
» A Simplified Idea Algorithm
Sort
View
117
Voted
WSC
2008
15 years 2 months ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese
99
Voted
ATAL
2008
Springer
15 years 2 months ago
Coordination in ambiguity: coordinated active localization for multiple robots
In environments which possess relatively few features that enable a robot to unambiguously determine its location, global localization algorithms can result in multiple hypotheses...
Shivudu Bhuvanagiri, K. Madhava Krishna, Supreeth ...
103
Voted
DAC
2005
ACM
15 years 2 months ago
Timing-driven placement by grid-warping
Grid-warping is a recent placement strategy based on a novel physical analogy: rather than move the gates to optimize their location, it elastically deforms a model of the 2-D chi...
Zhong Xiu, Rob A. Rutenbar
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
15 years 2 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
97
Voted
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
15 years 2 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan