Sciweavers

7311 search results - page 329 / 1463
» Time in State Machines
Sort
View
JMLR
2006
108views more  JMLR 2006»
15 years 7 months ago
The Interplay of Optimization and Machine Learning Research
The fields of machine learning and mathematical programming are increasingly intertwined. Optimization problems lie at the heart of most machine learning approaches. The Special T...
Kristin P. Bennett, Emilio Parrado-Hernánde...
193
Voted
ICALP
2009
Springer
16 years 7 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
170
Voted
ICESS
2005
Springer
16 years 1 months ago
Self-correction of FPGA-Based Control Units
This paper presents a self-correcting control unit design using Hamming codes for finite state machine (FSM) state encoding. The adopted technique can correct single-bit errors and...
Iouliia Skliarova
198
Voted
BIRTHDAY
2009
Springer
15 years 8 months ago
An ASM-Characterization of a Class of Distributed Algorithms
Conventional computation models restrict to particular data structures to represent states of a computation, e.g. natural numbers, s, stacks, etc. Gurevich's Abstract State Ma...
Andreas Glausch, Wolfgang Reisig
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 9 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou