Sciweavers

2019 search results - page 343 / 404
» Programming with Shared Data Abstractions
Sort
View
CPAIOR
2009
Springer
14 years 4 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
CIBCB
2006
IEEE
14 years 3 months ago
Motif Evaluation by Leave-one-out Scoring
Abstract— We propose a new method for collecting information on regulatory elements found by any motif discovery program. We suggest that combining the results of n leave-oneout ...
Audrey Girouard, Noah W. Smith, Donna K. Slonim
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
14 years 2 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
UM
2001
Springer
14 years 2 months ago
A User Modeling Approach to Determining System Initiative in Mixed-Initiative AI Systems
Abstract. In this paper, we address the problem of providing guidelines to designers of mixed-initiative artificial intelligence systems, which specify when the system should take...
Michael W. Fleming, Robin Cohen
IFIP
1998
Springer
14 years 1 months ago
Mobile agent technology in support of sales order processing in the virtual enterprise
The flexible integration of a range of disparate IT applications is a key requirement for today's global enterprises. The virtual enterprise, formed by a collection of collab...
Todd Papaioannou, John Edwards