Sciweavers

1968 search results - page 165 / 394
» The Complexity of Valued Constraint Models
Sort
View
JAIR
2008
98views more  JAIR 2008»
15 years 4 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
SP
2006
IEEE
214views Security Privacy» more  SP 2006»
15 years 10 months ago
Automatically Generating Malicious Disks using Symbolic Execution
Many current systems allow data produced by potentially malicious sources to be mounted as a file system. File system code must check this data for dangerous values or invariant ...
Junfeng Yang, Can Sar, Paul Twohey, Cristian Cadar...
NIPS
1998
15 years 5 months ago
Risk Sensitive Reinforcement Learning
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
Ralph Neuneier, Oliver Mihatsch
CA
2003
IEEE
15 years 9 months ago
Realistic Human Walking Paths
Pedestrian navigation is a complex function of human dynamics, a desired destination, and the presence of obstacles. People cannot stop and start instantaneously and their turning...
David C. Brogan, Nicholas L. Johnson
INFSOF
2010
107views more  INFSOF 2010»
15 years 1 months ago
A systematic review on strategic release planning models
Context. Strategic release planning (sometimes referred to as road-mapping) is an important phase of the requirements engineering process performed at product level. It is concern...
Mikael Svahnberg, Tony Gorschek, Robert Feldt, Ric...