Sciweavers

450 search results - page 46 / 90
» Satisfiability with Exponential Families
Sort
View
EPIA
1997
Springer
15 years 8 months ago
GenSAT: A Navigational Approach
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
Yury V. Smirnov, Manuela M. Veloso
ANOR
2008
90views more  ANOR 2008»
15 years 4 months ago
Multiple orders per job batch scheduling with incompatible jobs
: The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is ...
Vishnu Erramilli, Scott J. Mason
JUCS
2006
107views more  JUCS 2006»
15 years 4 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
CCS
2009
ACM
15 years 2 months ago
RFID privacy: relation between two notions, minimal condition, and efficient construction
Privacy of RFID systems is receiving increasing attention in the RFID community. Basically, there are two kinds of RFID privacy notions: one based on the indistinguishability of t...
Changshe Ma, Yingjiu Li, Robert H. Deng, Tieyan Li
ICML
2005
IEEE
16 years 5 months ago
Weighted decomposition kernels
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
Sauro Menchetti, Fabrizio Costa, Paolo Frasconi