Sciweavers

5981 search results - page 796 / 1197
» time 2006
Sort
View
KI
2006
Springer
15 years 6 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
SIAMSC
2008
149views more  SIAMSC 2008»
15 years 6 months ago
Adaptive Discrete Galerkin Methods Applied to the Chemical Master Equation
In systems biology, the stochastic description of biochemical reaction kinetics is increasingly being employed to model gene regulatory networks and signalling pathways. Mathematic...
Peter Deuflhard, Wilhelm Huisinga, T. Jahnke, Mich...
JDA
2007
129views more  JDA 2007»
15 years 6 months ago
Approximating the k-traveling repairman problem with repairtimes
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
Raja Jothi, Balaji Raghavachari
ICMCS
2006
IEEE
130views Multimedia» more  ICMCS 2006»
16 years 27 days ago
Directional Weighting-Based Demosaicking Algorithm for Noisy CFA Environments
Captured CFA data by image sensors like CCD/or CMOS are often corrupted by noises. To produce high quality images acquired by CCD/CMOS digital cameras, the problem of noise needs ...
Hung-Yi Lo, Tsung-Nan Lin, Chih-Lung Hsu, Cheng-hs...
GLOBECOM
2006
IEEE
16 years 27 days ago
Multi-Stage Investment Decision under Contingent Demand for Networking Planning
Telecommunication companies, such as Internet and cellular service providers, are seeing rapid and uncertain growth of traffic routed through their networks. It has become a chall...
Miguel F. Anjos, Michael Desroches, Anwar Haque, O...