Sciweavers

1727 search results - page 110 / 346
» A Technique for Large Automated Mechanism Design Problems
Sort
View
JAIR
2006
122views more  JAIR 2006»
15 years 6 months ago
Solving Factored MDPs with Hybrid State and Action Variables
Efficient representations and solutions for large decision problems with continuous and discrete variables are among the most important challenges faced by the designers of automa...
Branislav Kveton, Milos Hauskrecht, Carlos Guestri...
ICSE
2003
IEEE-ACM
16 years 6 months ago
Architecture-Level Requirements Specification
The large gap in the levels at which requirements are specified results in inadequate means for ensuring that business goals are properly supported. Architecture-level requirement...
Davor Svetinovic
CADE
2004
Springer
16 years 6 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
ICPP
2002
IEEE
15 years 11 months ago
Out-of-Order Instruction Fetch Using Multiple Sequencers
Conventional instruction fetch mechanisms fetch contiguous blocks of instructions in each cycle. They are difficult to scale since taken branches make it hard to increase the siz...
Paramjit S. Oberoi, Gurindar S. Sohi
ISDA
2008
IEEE
16 years 26 days ago
Genetic Annealing Optimization: Design and Real World Applications
Both simulated annealing (SA) and the genetic algorithms (GA) are stochastic and derivative-free optimization technique. SA operates on one solution at a time, while the GA mainta...
Mostafa A. El-Hosseini, Aboul Ella Hassanien, Ajit...