1688 search results - page 83 / 338 » The Complexity of Rationalizing Matchings |
174
Voted
DC
2010
15 years 17 days ago
2010
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
196
click to vote
CVPR
2009
IEEE
16 years 12 months ago
2009
IEEE
We describe a novel and robust feature descriptor called ordinal spatial intensity distribution (OSID) which is invariant to any monotonically increasing brightness changes. Many t...
170
click to vote
ICPR
2002
IEEE
16 years 6 months ago
2002
IEEE
In this paper we address two aspects related to the exploitation of Support Vector Machines (SVM) for classification in real application domains, such as the detection of objects ...
141
click to vote
CSL
2007
Springer
15 years 11 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
154
click to vote
ECAIW
2000
Springer
15 years 10 months ago
2000
Springer
This paper discusses the hierarchical control architecture used to generate the behavior of individual agents and a team of robots for the RoboCup Small Size competition. Our react...