Sciweavers

14649 search results - page 319 / 2930
» Principles of problem solving
Sort
View
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 12 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
ESA
2003
Springer
77views Algorithms» more  ESA 2003»
15 years 12 months ago
An Optimal Algorithm for the Maximum-Density Segment Problem
We address a fundamental problem arising from analysis of biomolecular sequences. The input consists of two numbers wmin and wmax and a sequence S of n number pairs (ai, wi) with ...
Kai-min Chung, Hsueh-I Lu
HEURISTICS
2010
15 years 4 months ago
A metaheuristic approach to the urban transit routing problem
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
Lang Fan, Christine L. Mumford
SIAMDM
2010
99views more  SIAMDM 2010»
15 years 1 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
ICASSP
2009
IEEE
16 years 1 months ago
Using phase linearity in frequency-domain ICA to tackle the permutation problem
This paper describes a method for solving the permutation problem in the frequency-domain independent component analysis (FD-ICA) approach to blind source separation (BSS). FD-ICA...
Keisuke Toyama, Mark D. Plumbley