Sciweavers

107 search results - page 3 / 22
» Workforce planning with parallel algorithms
Sort
View
123
Voted
EDOC
2011
IEEE
14 years 27 days ago
Resource and Agreement Management in Dynamic Crowdcomputing Environments
Abstract—Open Web-based and social platforms dramatically influence models of work. Today, there is an increasing interest in outsourcing tasks to crowdsourcing environments tha...
Harald Psaier, Florian Skopik, Daniel Schall, Scha...
108
Voted
ECP
1999
Springer
138views Robotics» more  ECP 1999»
15 years 5 months ago
Numeric State Variables in Constraint-Based Planning
We extend a planning algorithm to cover simple forms of arithmetics. The operator preconditions can refer to the values of numeric variables and the operator postconditions can mod...
Jussi Rintanen, Hartmut Jungholt
117
Voted
PPAM
2005
Springer
15 years 6 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
Dariusz Dereniowski, Marek Kubale
104
Voted
FUIN
2006
139views more  FUIN 2006»
15 years 1 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
100
Voted
CPAIOR
2006
Springer
15 years 4 months ago
An Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Zhao Xing, Yixin Chen, Weixiong Zhang