11 search results - page 1 / 3 » How to Tackle Integer Weighted Automata Positivity |
RP
2009
Springer
13 years 11 months ago
2009
Springer
SCP
2010
13 years 3 months ago
2010
Several scienti c bottlenecks have been identi ed in existing component-based approaches. em, we focus on the identi cation of a relevant abstraction for the component expression ...
FMSD
2007
13 years 4 months ago
2007
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
COLT
2003
Springer
13 years 10 months ago
2003
Springer
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ...
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
It is to date an open question to know how the updating methods affect the evolution of a multi-agent system. This question has been tackled for various complex systems such as ce...