Sciweavers

201 search results - page 28 / 41
» Reducing the number of clock variables of timed automata
Sort
View
NIPS
2007
13 years 9 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
AICT
2010
IEEE
216views Communications» more  AICT 2010»
12 years 11 months ago
A Simplified Method for Optimising Sequentially Processed Access Control Lists
Among the various options for implementing Internet packet filters in the form of Access Control Lists (ACLs), is the intuitive – but potentially crude – method of processing t...
Vic Grout, John Davies
EOR
2007
101views more  EOR 2007»
13 years 7 months ago
Using aggregation to optimize long-term production planning at an underground mine
Motivated by an underground mining operation at Kiruna, Sweden, we formulate a mixed integer program to schedule iron ore production over multiple time periods. Our optimization m...
Alexandra M. Newman, Mark Kuchta
HPCA
2009
IEEE
14 years 8 months ago
Versatile prediction and fast estimation of Architectural Vulnerability Factor from processor performance metrics
The shrinking processor feature size, lower threshold voltage and increasing clock frequency make modern processors highly vulnerable to transient faults. Architectural Vulnerabil...
Lide Duan, Bin Li, Lu Peng
ECOOP
2004
Springer
14 years 29 days ago
Demand-Driven Type Inference with Subgoal Pruning: Trading Precision for Scalability
After two decades of effort, type inference for dynamically typed languages scales to programs of a few tens of thousands of lines of code, but no further. For larger programs, th...
S. Alexander Spoon, Olin Shivers