Sciweavers

4894 search results - page 387 / 979
» Choices
Sort
View
192
Voted
CORR
2008
Springer
84views Education» more  CORR 2008»
15 years 7 months ago
A Paradigm for Spreadsheet Engineering Methodologies
Spreadsheet engineering methodologies are diverse and sometimes contradictory. It is difficult for spreadsheet developers to identify a spreadsheet engineering methodology that is...
Thomas A. Grossman, Ozgur Ozluk
197
Voted
CORR
2010
Springer
132views Education» more  CORR 2010»
15 years 7 months ago
Small NFAs from Regular Expressions: Some Experimental Results
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
Hugo Gouveia, Nelma Moreira, Rogério Reis
CORR
2008
Springer
124views Education» more  CORR 2008»
15 years 7 months ago
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
Daniel Raible, Henning Fernau
CORR
2008
Springer
87views Education» more  CORR 2008»
15 years 7 months ago
Green Codes: Energy-Efficient Short-Range Communication
Abstract-- A green code attempts to minimize the total energy per-bit required to communicate across a noisy channel. The classical information-theoretic approach neglects the ener...
Pulkit Grover, Anant Sahai
CPC
2010
81views more  CPC 2010»
15 years 7 months ago
The Linus Sequence
Define the Linus sequence Ln for n 1 as a 0-1 sequence with L1 = 0, and Ln chosen so as to minimize the length of the longest immediately repeated block Ln-2r+1 . . . Ln-r = Ln-r...
Paul Balister, Steve Kalikow, Amites Sarkar