Sciweavers

1449 search results - page 75 / 290
» Finiteness results for sigmoidal
Sort
View
TARK
1998
Springer
15 years 10 months ago
Beating a Finite Automaton in the Big Match
We look at the Big Match game, a variation of the repeated Matching Pennies game where if the rst player plays tails the game ends with the rst player receiving the last round...
Lance Fortnow, Peter G. Kimmel
VLSID
1997
IEEE
98views VLSI» more  VLSID 1997»
15 years 10 months ago
Synthesis for Logical Initializability of Synchronous Finite State Machines
—Logical initializability is the property of a gate-level circuit whereby it can be driven to a unique start state when simulated by a three-valued (0, 1, ) simulator. In practic...
Montek Singh, Steven M. Nowick
ICLP
1991
Springer
15 years 9 months ago
{log}: A Logic Programming Language with Finite Sets
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
Agostino Dovier, Eugenio G. Omodeo, Enrico Pontell...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 8 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
NIPS
2007
15 years 7 months ago
Cluster Stability for Finite Samples
Over the past few years, the notion of stability in data clustering has received growing attention as a cluster validation criterion in a sample-based framework. However, recent w...
Ohad Shamir, Naftali Tishby