Sciweavers

4110 search results - page 441 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
230
Voted
CIKM
2008
Springer
15 years 8 months ago
A sparse gaussian processes classification framework for fast tag suggestions
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
Yang Song, Lu Zhang 0007, C. Lee Giles
TASE
2011
IEEE
14 years 10 months ago
Fast Intersection-Free Offset Surface Generation From Freeform Models With Triangular Meshes
Abstract—A fast offset surface generation approach is presented in this paper to construct intersection-free offset surfaces, which preserve sharp features, from freeform triangu...
Shengjun Liu, Charlie C. L. Wang
JALC
2006
143views more  JALC 2006»
15 years 6 months ago
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...
Oscar H. Ibarra, Bala Ravikumar, Cagdas Evren Gere...
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
15 years 4 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
ATAL
2006
Springer
15 years 10 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...