Sciweavers

944 search results - page 168 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
ICML
2009
IEEE
15 years 10 months ago
SimpleNPKL: simple non-parametric kernel learning
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
Jinfeng Zhuang, Ivor W. Tsang, Steven C. H. Hoi
PODC
1997
ACM
15 years 2 months ago
Lazy Consistency Using Loosely Synchronized Clocks
Thispaperdescribesanewschemeforguaranteeingthattransactions in a client/server system observe consistent state while they are running. The scheme is presented in conjunction with ...
Atul Adya, Barbara Liskov
ATAL
2007
Springer
15 years 4 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
GECCO
2007
Springer
308views Optimization» more  GECCO 2007»
15 years 4 months ago
Multiobjective clustering with automatic k-determination for large-scale data
Web mining - data mining for web data - is a key factor of web technologies. Especially, web behavior mining has attracted a great deal of attention recently. Behavior mining invo...
Nobukazu Matake, Tomoyuki Hiroyasu, Mitsunori Miki...
GBRPR
2007
Springer
15 years 1 months ago
Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
Christine Solnon, Jean-Michel Jolion