1700 search results - page 317 / 340 » Specifying and implementing refactorings |
COCOON
2010
Springer
15 years 4 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
112
Voted
COMPSAC
2009
IEEE
15 years 4 months ago
2009
IEEE
Matrices are essential in many fields of computer science, especially when large amounts of data must be handled efficiently. Despite this demand for matrix software, we were una...
106
click to vote
HOTSWUP
2009
ACM
15 years 4 months ago
2009
ACM
The complexity, cost, and down-time currently created by the database schema evolution process is the source of incessant problems in the life of information systems and a major s...
AGENTS
2000
Springer
15 years 4 months ago
2000
Springer
Multi-agent systems are prone to failures typical of any distributed system. Agents and resources may become unavailable due to machine crashes, communication breakdowns, process ...
CIAC
2000
Springer
15 years 4 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...