Sciweavers

2412 search results - page 418 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
TCAD
2008
103views more  TCAD 2008»
13 years 7 months ago
Topology-Based Performance Analysis and Optimization of Latency-Insensitive Systems
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
Rebecca L. Collins, Luca P. Carloni
TSP
2008
112views more  TSP 2008»
13 years 7 months ago
An Algebraic Coding Scheme for Wireless Relay Networks With Multiple-Antenna Nodes
Abstract--We consider the problem of coding over a half-duplex wireless relay network where both the transmitter and the receiver have respectively several transmit and receive ant...
Frédérique E. Oggier, Babak Hassibi
LOGCOM
2007
91views more  LOGCOM 2007»
13 years 7 months ago
A New Modal Approach to the Logic of Intervals
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
Altaf Hussain
CONSTRAINTS
2004
116views more  CONSTRAINTS 2004»
13 years 7 months ago
Decision Tradeoff Using Example-Critiquing and Constraint Programming
We consider constructive preference elicitation for decision aid systems in applications such as configuration or electronic catalogs. We are particularly interested in supporting ...
Pearl Pu, Boi Faltings
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
13 years 7 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham