Sciweavers

5214 search results - page 99 / 1043
» The Online Specialization Problem
Sort
View
INFORMATICALT
2000
125views more  INFORMATICALT 2000»
13 years 8 months ago
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
Gintaras Palubeckis
IROS
2008
IEEE
91views Robotics» more  IROS 2008»
14 years 3 months ago
Replanning: A powerful planning strategy for hard kinodynamic problems
— A series of kinodynamic sampling-based planners have appeared over the last decade to deal with high dimensional problems for robots with realistic motion constraints. Yet, ofï...
Konstantinos I. Tsianos, Lydia E. Kavraki
ISQED
2000
IEEE
131views Hardware» more  ISQED 2000»
14 years 1 months ago
Low Power Testing of VLSI Circuits: Problems and Solutions
Power and energy consumption of digital systems may increase significantly during testing. This extra power consumption due to test application may give rise to severe hazards to ...
Patrick Girard
CSREAEEE
2008
199views Business» more  CSREAEEE 2008»
13 years 10 months ago
Progranimate - A Web Enabled Algorithmic Problem Solving Application
- This paper proposes the use of an interactive web based problem solving application that utilises flowchart based programming and code generation to address the issues faced by n...
Andrew Scott, Mike Watkins, Duncan McPhee
JAL
2006
89views more  JAL 2006»
13 years 9 months ago
Improved bounds for the unsplittable flow problem
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
Petr Kolman, Christian Scheideler