Sciweavers

499 search results - page 21 / 100
» Multilevel algorithms for linear ordering problems
Sort
View
WWW
2008
ACM
14 years 9 months ago
Composite process oriented service discovery in preserving business and timed relation
This paper proposes an approach for solving the problem of composite process oriented service discovery with preserving business and timed relation. Key to our approach is the def...
Yu Dai, Lei Yang, Bin Zhang, Kening Gao
AAAI
2006
13 years 10 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
ISSAC
2004
Springer
102views Mathematics» more  ISSAC 2004»
14 years 2 months ago
FFPACK: finite field linear algebra package
The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many a...
Jean-Guillaume Dumas, Pascal Giorgi, Clémen...
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
14 years 2 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 9 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng