Sciweavers

257 search results - page 6 / 52
» A (Somewhat) New Solution to the Variable Binding Problem
Sort
View
CORR
2007
Springer
72views Education» more  CORR 2007»
13 years 7 months ago
A Heuristic Routing Mechanism Using a New Addressing Scheme
Current methods of routing are based on network information in the form of routing tables, in which routing protocols determine how to update the tables according to the network ch...
Mohsen Ravanbakhsh, Yasin Abbasi-Yadkori, Maghsoud...
JAIR
2006
122views more  JAIR 2006»
13 years 7 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...
JCP
2008
135views more  JCP 2008»
13 years 7 months ago
Hybrid Evolutionary Algorithm Based Solution for Register Allocation for Embedded Systems
Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either memory or registers are use...
Anjali Mahajan, M. S. Ali
CCE
2008
13 years 7 months ago
Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
Yi Cao, Vinay Kariwala
AIPS
2007
13 years 9 months ago
On the Hardness of Planning Problems with Simple Causal Graphs
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
Omer Giménez, Anders Jonsson