1650 search results - page 139 / 330 » The HOM problem is decidable |
144
click to vote
IANDC
2008
15 years 4 months ago
2008
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
126
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
141
click to vote
JAIR
2007
15 years 4 months ago
2007
It is widely recognized today that the management of imprecision and vagueness will yield more intelligent and realistic knowledge-based applications. Description Logics (DLs) are...
139
click to vote
AI
2002
Springer
15 years 4 months ago
2002
Springer
Most classification algorithms are "passive", in that they assign a class label to each instance based only on the description given, even if that description is incompl...
125
click to vote
MST
2010
15 years 2 months ago
2010
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...