Sciweavers

81 search results - page 7 / 17
» Computing Equilibria Using Interval Constraints
Sort
View
FUIN
2010
143views more  FUIN 2010»
13 years 4 months ago
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
Ismel Brito, Pedro Meseguer
ISSS
1999
IEEE
157views Hardware» more  ISSS 1999»
13 years 11 months ago
Bit-Width Selection for Data-Path Implementations
Specifications of data computations may not necessarily describe the ranges of the intermediate results that can be generated. However, such information is critical to determine t...
Carlos Carreras, Juan A. López, Octavio Nie...
RECOMB
2002
Springer
14 years 7 months ago
Significance Of inter-species matches when evolutionary rate varies
We develop techniques to estimate the statistical significance of gap-free alignments between two genomic DNA sequences, using human-mouse alignments as an example. The sequences ...
Jia Li, Webb Miller
SCP
1998
163views more  SCP 1998»
13 years 7 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
SAC
2006
ACM
14 years 1 months ago
Post-partition reconciliation protocols for maintaining consistency
This paper addresses design exploration for protocols that are employed in systems with availability-consistency tradeoffs. Distributed data is modelled as states of objects repl...
Mikael Asplund, Simin Nadjm-Tehrani