9325 search results - page 439 / 1865 » The decentralized implementability problem |
127
click to vote
INFOSCALE
2006
ACM
15 years 11 months ago
2006
ACM
Abstract— Comparing genetic sequences is a well-known problem in bioinformatics. Newly determined sequences are being compared to known sequences stored in databases in order to ...
112
click to vote
SAC
2005
ACM
15 years 10 months ago
2005
ACM
In this paper we describe a serializer component completely realized in .NET managed code, able to run on a stripped versions of the .NET platform (e.g., Compact Framework) and st...
158
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
141
click to vote
ICCSA
2004
Springer
15 years 10 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
150
click to vote
ICWE
2004
Springer
15 years 10 months ago
2004
Springer
Abstract Loosely coupled services are gaining importance in many business domains. However, compared to OO-RPC middleware approaches, emerging technologies proposed to implement lo...