1763 search results - page 187 / 353 » A Formalization of Polytime Functions |
104
click to vote
FORMATS
2010
Springer
14 years 12 months ago
2010
Springer
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
137
click to vote
ENASE
2009
14 years 11 months ago
2009
Abstract. The design of dynamic discrete-event systems calls for adequate modeling formalisms and tools to manage possible changes occurring during system's lifecycle. A commo...
133
click to vote
FORTE
2009
14 years 11 months ago
2009
Abstract. Service compositions leverage remote services to deliver addedvalue distributed applications. Since services are administered and run by independent parties, the governan...
130
click to vote
ICFCA
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. Standard Support Vector Machines (SVM) text classification relies on bag-of-words kernel to express the similarity between documents. We show that a document lattice can ...
161
click to vote
TEC
2012
13 years 4 months ago
2012
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...