Sciweavers

4047 search results - page 429 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
IPPS
2009
IEEE
16 years 1 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...
ACSC
2007
IEEE
16 years 1 months ago
Mutually Visible Agents in a Discrete Environment
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
Joel Fenwick, Vladimir Estivill-Castro
WAOA
2007
Springer
132views Algorithms» more  WAOA 2007»
16 years 26 days ago
Buyer-Supplier Games: Optimization over the Core
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...
Nedialko B. Dimitrov, C. Greg Plaxton
ALT
1999
Springer
15 years 11 months ago
On the Uniform Learnability of Approximations to Non-Recursive Functions
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
Frank Stephan, Thomas Zeugmann
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
15 years 10 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith