Sciweavers

1760 search results - page 331 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 7 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
XPU
2007
Springer
14 years 1 months ago
Empirical Evidence Principle and Joint Engagement Practice to Introduce XP
Bringing software process change to an organisation is a real challenge. The authors have shown a sample attempt to carry out a process change and then reflected on its results and...
Lech Madeyski, Wojciech Biela
CP
2004
Springer
14 years 1 months ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
Vincent A. Cicirello, Stephen F. Smith
ECAI
2004
Springer
14 years 1 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
CHI
1999
ACM
13 years 12 months ago
A Better Mythology for System Design
The past decades have seen huge improvements in computer systems but these have proved difficult to translate into comparable improvements in the usability and social integration)...
Jed Harris, D. Austin Henderson Jr.