Sciweavers

1115 search results - page 68 / 223
» An Abstract Look at Realizability
Sort
View
PPSN
2004
Springer
16 years 2 days ago
Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
Jano I. van Hemert, Neil Urquhart
175
Voted
TYPES
2004
Springer
16 years 2 days ago
A Content Based Mathematical Search Engine: Whelp
Abstract. The prototype of a content based search engine for mathematical knowledge supporting a small set of queries requiring matching and/or typing operations is described. The ...
Andrea Asperti, Ferruccio Guidi, Claudio Sacerdoti...
PDP
2010
IEEE
16 years 1 days ago
DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm
Abstract—Among the numerous DAG scheduling heuristics suitable for heterogeneous systems, the Heterogeneous Earliest Finish Time (HEFT) heuristic is known to give good results in...
Luiz F. Bittencourt, Rizos Sakellariou, Edmundo R....
ICRA
2003
IEEE
128views Robotics» more  ICRA 2003»
16 years 18 hour ago
Avoiding unsafe states in manufacturing systems based on polynomial digraph algorithms
Abstract − A deadlock-free unsafe (DFU) state of Resource Allocation System (RAS) is deadlock-free but inevitable to enter a deadlock state. Previous research revealed that in ma...
Yin Wang, Zhiming Wu
IWPC
2003
IEEE
16 years 11 hour ago
Are Decomposition Slices Clones?
When computing program slices on all variables in a system, we observed that many of these slices are the same. This leads to the question: Are we looking at software clones? We d...
Keith Gallagher, Lucas Layman