Sciweavers

1568 search results - page 130 / 314
» The problem of examination questions in algorithmics
Sort
View
CDC
2009
IEEE
143views Control Systems» more  CDC 2009»
15 years 9 months ago
Control interpretations of products in the Hopf algebra
Abstract— Families of differential operators, like those defining affine, generally nonlinear, control systems are known to have natural Hopf algebra structures. These provide ...
Matthias Kawski
HIPC
2007
Springer
15 years 8 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
148
Voted
JAIR
2011
123views more  JAIR 2011»
14 years 11 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
TEC
2010
77views more  TEC 2010»
14 years 11 months ago
On Set-Based Multiobjective Optimization
Abstract--Assuming that evolutionary multiobjective optimization (EMO) mainly deals with set problems, one can identify three core questions in this area of research: (i) how to fo...
Eckart Zitzler, Lothar Thiele, Johannes Bader
JPDC
2008
100views more  JPDC 2008»
15 years 4 months ago
Data-stream-based global event monitoring using pairwise interactions
The problem of global state observation is fundamental to distributed systems and to the analysis of data streams. Many interactions in distributed systems can be analyzed in term...
Punit Chandra, Ajay D. Kshemkalyani