51692 search results - page 10211 / 10339 » it 2008 |
115
Voted
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
139
Voted
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
156
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
148
Voted
ESAW
2008
Springer
15 years 6 months ago
2008
Springer
A workflow involves the coordinated execution of multiple operations and can be used to capture business processes. Typical workflow management systems are centralised and rigid; t...
124
click to vote
ESEM
2008
ACM
15 years 6 months ago
2008
ACM
Software process improvement initiatives such as metrics programs have a high failure rate during their assimilation in a software organization. Social and organizational issues a...