Sciweavers

1215 search results - page 186 / 243
» Application domain study of evolutionary algorithms in optim...
Sort
View
AISC
1998
Springer
15 years 5 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
INFOCOM
2006
IEEE
15 years 7 months ago
Nomadic Service Points
— We consider the novel problem of dynamically assigning application sessions of mobile users or user groups to service points. Such assignments must balance the tradeoff between...
Edward Bortnikov, Israel Cidon, Idit Keidar
WEBDB
2009
Springer
115views Database» more  WEBDB 2009»
15 years 8 months ago
A Machine Learning Approach to Foreign Key Discovery
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...
Alexandra Rostin, Oliver Albrecht, Jana Bauckmann,...
ICCS
2003
Springer
15 years 6 months ago
Self-Adapting Numerical Software and Automatic Tuning of Heuristics
Self-Adapting Numerical Software (SANS) systems aim to bridge the knowledge gap that exists between the expertise of domain scientists, and the know-how that is needed to fulfill...
Jack Dongarra, Victor Eijkhout
SPAA
2005
ACM
15 years 7 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi