3229 search results - page 292 / 646 » The Theory of Timed Automata |
191
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
173
click to vote
BC
2007
15 years 6 months ago
2007
We present a new approach of explaining partial causality in multivariate fMRI time series by a state space model. A given single time series can be divided into two noise-driven ...
162
click to vote
AIMS
2007
Springer
16 years 29 days ago
2007
Springer
Promise theory defines a method by which static service bindings are made in a network, but little work has been done on handling the dynamic case in which bindings must change ov...
168
click to vote
HICSS
2006
IEEE
16 years 25 days ago
2006
IEEE
Bandura’s theories of self- and collective efficacy are widely recognized in many fields, including psychology and management, but have been largely unnoticed by the Human-Compu...
175
click to vote
ACMICEC
2003
ACM
16 years 1 days ago
2003
ACM
We discuss a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids. We are interested in b...