Sciweavers

291 search results - page 16 / 59
» The Bidimensionality Theory and Its Algorithmic Applications
Sort
View
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
14 years 1 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
AAAI
2008
13 years 10 months ago
Grounding with Bounds
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain...
Johan Wittocx, Maarten Mariën, Marc Denecker
DNA
2007
Springer
159views Bioinformatics» more  DNA 2007»
14 years 1 months ago
Activatable Tiles: Compact, Robust Programmable Assembly and Other Applications
While algorithmic DNA self-assembly is, in theory, capable of forming complex patterns, its experimental demonstration has been limited by significant assembly errors. In this pa...
Urmi Majumder, Thomas H. LaBean, John H. Reif
IJRR
2008
73views more  IJRR 2008»
13 years 7 months ago
Optimization of Complex Robot Applications under Real Physical Limitations
This paper deals with minimum time trajectory optimization along a specified path subject to thermal constraints. We point out here that robots are often integrated in complex rob...
Matthieu Guilbert, Luc D. Joly, Pierre-Brice Wiebe...
FSE
1997
Springer
280views Cryptology» more  FSE 1997»
13 years 11 months ago
New Block Encryption Algorithm MISTY
We propose secret-key cryptosystems MISTY1 and MISTY2, which are block ciphers with a 128-bit key, a 64-bit block and a variable number of rounds. MISTY is a generic name for MISTY...
Mitsuru Matsui