Sciweavers

4451 search results - page 78 / 891
» On Random Ordering Constraints
Sort
View
JC
2006
53views more  JC 2006»
14 years 11 months ago
The randomized information complexity of elliptic PDE
We study the information complexity in the randomized setting of solving a general elliptic PDE of order 2m in a smooth, bounded domain Q Rd with smooth coefficients and homogene...
Stefan Heinrich
ICMLA
2004
15 years 1 months ago
RAIN: data clustering using randomized interactions between data points
Abstract-- This paper introduces a generalization of the Gravitational Clustering Algorithm proposed by Gomez et all in [1]. First, it is extended in such a way that not only the G...
Jonatan Gómez, Olfa Nasraoui, Elizabeth Leo...
MATES
2007
Springer
15 years 6 months ago
Using DESs for Temporal Diagnosis of Multi-agent Plan Execution
The most common reason for plan repair are the violation of a plan’s temporal constraints. Air Traffic Control is an example of an area in which violations of the plan’s tempo...
Femke de Jonge, Nico Roos, Huib Aldewereld
CEC
2008
IEEE
15 years 6 months ago
Conventionalization of linguistic categories under simple communicative constraints
—The language game approach is widely adopted to study conventionalization of linguistic knowledge. Most of contemporary models concentrate on the dynamics of language games in r...
Tao Gong, Andrea Puglisi, Vittorio Loreto, William...
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 1 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter