Sciweavers

1615 search results - page 146 / 323
» Computer science and decision theory
Sort
View
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
15 years 5 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
CSR
2007
Springer
15 years 6 months ago
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
Artur Jez, Alexander Okhotin
CSE
2009
IEEE
15 years 5 months ago
A Failure Adapted, Load-Balanced Distributed Routing for Wireless Ad Hoc Sensor Networks
— this paper proposes a distributed routing protocol for ad hoc sensor networks which uses Fuzzy Logic. Each sensor uses a Fuzzy decision making process to find the best Cluster ...
Shahram Nourizadeh, Yeqiong Song, Jean-Pierre Thom...
90
Voted
ICSE
2003
IEEE-ACM
16 years 24 days ago
Using Benchmarking to Advance Research: A Challenge to Software Engineering
Benchmarks have been used in computer science to compare the performance of computer systems, information retrieval algorithms, databases, and many other technologies. The creatio...
Susan Elliott Sim, Steve M. Easterbrook, Richard C...
84
Voted
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 6 months ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm