Sciweavers

11328 search results - page 165 / 2266
» Timed Branching Processes
Sort
View
118
Voted
IJCAI
2001
15 years 5 months ago
Computational Complexity of Planning with Temporal Goals
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
Chitta Baral, Vladik Kreinovich, Raul Trejo
JAPLL
2008
88views more  JAPLL 2008»
15 years 3 months ago
Living up to one's commitments: Agency, strategies and trust
In human social interaction, the notions of commitment and trust are strongly interrelated. A formal model for this interrelation will enable artificial agents to benefit from the...
Thomas Müller
EOR
2002
99views more  EOR 2002»
15 years 3 months ago
Network cost minimization using threshold-based discounting
We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes t...
Hrvoje Podnar, Jadranka Skorin-Kapov, Darko Skorin...
TCS
2002
15 years 3 months ago
The continuum as a final coalgebra
oole.stanford.edu/pub/ABSTRACTS Pratt, V.R., "Transition and Cancellation in Concurrency and Branching Time", Math. Structures in Comp. Sci., 13:4, 485-529, August 2003. ...
Dusko Pavlovic, Vaughan R. Pratt
144
Voted
SIAMSC
2011
115views more  SIAMSC 2011»
14 years 10 months ago
A Fast and Stable Solver for Singular Integral Equations on Piecewise Smooth Curves
A scheme is presented for the numerical solution of singular integral equations on piecewise smooth curves. It relies on several techniques: reduction, Nystr¨om discretization, co...
Johan Helsing