Sciweavers

13841 search results - page 2637 / 2769
» Algorithms and Constraint Programming
Sort
View
ECCC
2011
185views ECommerce» more  ECCC 2011»
14 years 10 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
132
Voted
EOR
2011
113views more  EOR 2011»
14 years 10 months ago
A relation-algebraic approach to simple games
Simple games are a powerful tool to analyze decision-making and coalition formation in social and political life. In this paper, we present relation-algebraic models of simple game...
Rudolf Berghammer, Stefan Bolus, Agnieszka Rusinow...
TWC
2011
291views more  TWC 2011»
14 years 10 months ago
On Optimal Cooperator Selection Policies for Multi-Hop Ad Hoc Networks
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...
Michele Rossi, Cristiano Tapparello, Stefano Tomas...
IHI
2010
109views Healthcare» more  IHI 2010»
14 years 10 months ago
Process-based derivation of requirements for medical devices
One goal of medical device certification is to show that a given medical device satisfies its requirements. The requirements that should be met by a device, however, depend on the...
Heather M. Conboy, George S. Avrunin, Lori A. Clar...
LOGCOM
2010
120views more  LOGCOM 2010»
14 years 10 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
« Prev « First page 2637 / 2769 Last » Next »