3359 search results - page 118 / 672 » A Simplified Idea Algorithm |
121
Voted
AIPS
2006
15 years 4 months ago
2006
Recently the problem of automatic composition of workflows has been receiving increasing interest. Initial investigation has shown that designing a practical and scalable composit...
153
click to vote
IPCO
1998
15 years 3 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
159
Voted
ASIAN
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
126
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
125
Voted
CGA
2008
15 years 2 months ago
2008
Mesh simplification and discrete levels of detail (LOD) are wellstudied areas of research in computer graphics. However, until recently, most of the developed algorithms have focu...