Sciweavers

1684 search results - page 126 / 337
» The lexicographic decision function
Sort
View
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
15 years 8 months ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Paul Beame, Joan Lawry
151
Voted
ANTS
2010
Springer
246views Algorithms» more  ANTS 2010»
15 years 7 months ago
On Weil Polynomials of K3 Surfaces
Abstract. For K3 surfaces, we derive some conditions the characteristic polynomial of the Frobenius on the ´etale cohomology must satisfy. These conditions may be used to speed up...
Andreas-Stephan Elsenhans, Jörg Jahnel
IJON
2006
63views more  IJON 2006»
15 years 3 months ago
Reward-biased probabilistic decision-making: Mean-field predictions and spiking simulations
In this work we study the basic competitive and cooperative mechanisms of neural activity in the context of a two-alternative freechoice eye-movement task, as a function of the ex...
Daniel Martí, Gustavo Deco, Paolo Del Giudi...
MJ
2006
102views more  MJ 2006»
15 years 3 months ago
Hybrid verification integrating HOL theorem proving with MDG model checking
In this paper, we describe a hybrid tool for hardware formal verification that links the HOL (higher-order logic) theorem prover and (multiway decision graphs) model checker. Our ...
Rabeb Mizouni, Sofiène Tahar, Paul Curzon
CSDA
2004
81views more  CSDA 2004»
15 years 3 months ago
Isotonic single-index model for high-dimensional database marketing
While database marketers collect vast amounts of customer transaction data, its utilization to improve marketing decisions presents problems. Marketers seek to extract relevant in...
Prasad A. Naik, Chih-Ling Tsai