518 search results - page 46 / 104 » Beating a Random Assignment |
111
click to vote
PADS
2005
ACM
15 years 8 months ago
2005
ACM
The use of software diversity has often been discussed in the research literature as an effective means to break up the software monoculture present on the Internet and to thus p...
120
click to vote
ATVA
2006
Springer
15 years 6 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We propose a new loss function for discriminative learning of Markov random fields, which is an intermediate loss function between the sequential loss and the pointwise loss. We s...
CSCLP
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
107
Voted
IVEVA
2004
15 years 3 months ago
2004
Abstract. In this paper we describe a system where behavior of characters and groups of characters are determined by assigning attributes to groups and individuals hierarchically a...