Sciweavers

3082 search results - page 93 / 617
» New Bounds for the Controller Problem
Sort
View
BPM
2008
Springer
134views Business» more  BPM 2008»
15 years 6 months ago
Digital Identity and Reputation in the Context of a Bounded Social Ecosystem
This paper highlights the problem of digital identity, or cross-set unique identifying tokens, inherent in the application of social software in business processes. As social softw...
Ben Jennings, Anthony Finkelstein
TAMC
2009
Springer
15 years 10 months ago
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...
Jasper Berendsen, Taolue Chen, David N. Jansen
GECCO
2005
Springer
15 years 9 months ago
A new approach to evaluate GP schema in context
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
Hammad Majeed
CP
2011
Springer
14 years 3 months ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
JMLR
2006
124views more  JMLR 2006»
15 years 4 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini