Sciweavers

3563 search results - page 591 / 713
» Scheduling Algorithms for Procrastinators
Sort
View
HIS
2008
15 years 6 months ago
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given ...
Bin Hu, Günther R. Raidl
AMC
2008
106views more  AMC 2008»
15 years 4 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido
IEICET
2008
121views more  IEICET 2008»
15 years 4 months ago
Multi-Constrained QoS Geographic Routing for Heterogeneous Traffic in Sensor Networks
Sensor nodes report the sensed data packets to the sink and depending on the application these packets may have diverse attributes: time-critical (TC) and non time-critical (NTC). ...
Md. Abdur Razzaque, Muhammad Mahbub Alam, Md. Mamu...
ENTCS
2006
137views more  ENTCS 2006»
15 years 4 months ago
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
Morgan Magnin, Didier Lime, Olivier H. Roux
ET
2002
105views more  ET 2002»
15 years 4 months ago
An Integrated Framework for the Design and Optimization of SOC Test Solutions
We propose an integrated framework for the design of SOC test solutions, which includes a set of algorithms for early design space exploration as well as extensive optimization for...
Erik Larsson, Zebo Peng