Sciweavers

2446 search results - page 459 / 490
» Choiceless Polynomial Time
Sort
View
JALC
2006
143views more  JALC 2006»
13 years 7 months ago
Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...
Oscar H. Ibarra, Bala Ravikumar, Cagdas Evren Gere...
SIAMSC
2008
149views more  SIAMSC 2008»
13 years 7 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...
TCSV
2008
155views more  TCSV 2008»
13 years 7 months ago
Heterogeneous Fusion of Omnidirectional and PTZ Cameras for Multiple Object Tracking
Dual-camera systems have been widely used in surveillance because of the ability to explore the wide field of view (FOV) of the omnidirectional camera and the wide zoom range of th...
Chung-Hao Chen, Yi Yao, David Page, Besma R. Abidi...
IOR
2010
161views more  IOR 2010»
13 years 6 months ago
Mechanism Design for Decentralized Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
12 years 7 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge