9325 search results - page 336 / 1865 » The decentralized implementability problem |
142
click to vote
IMECS
2007
15 years 6 months ago
2007
Abstract—Implementing binary methods in traditional object-oriented languages is difficult: numerous problems arise, such as typing (covariance vs. contravariance of the argument...
136
click to vote
CSC
2006
15 years 6 months ago
2006
- Symmetric level-index arithmetic was introduced to overcome the problems of overflow and underflow in scientific computations. A hybrid SLI-FLP number system, together with some ...
146
click to vote
FLAIRS
2003
15 years 6 months ago
2003
Over-constrained problems can be solved with the help of soft constraints. Weighted constraints are a typical representation of soft constraints used to minimize weights of unsati...
114
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
122
click to vote
JPDC
2006
15 years 4 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...