2693 search results - page 132 / 539 » French Order Without Order |
122
Voted
SOFSEM
2009
Springer
16 years 22 days ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
133
click to vote
CVPR
2010
IEEE
15 years 12 months ago
2010
IEEE
To detect multiple objects of interest, the methods based on Hough transform use non-maxima supression or mode seeking in order to locate and to distinguish peaks in Hough images....
CP
2009
Springer
15 years 10 months ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
170
click to vote
CSFW
2009
IEEE
15 years 10 months ago
2009
IEEE
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This pa...
130
click to vote
DDECS
2009
IEEE
15 years 10 months ago
2009
IEEE
—Quasi Delay Insensitive asynchronous logic is a very robust system allowing safe implementations while requiring minimal timing assumptions. Unfortunately the design methodologi...