Sciweavers

4377 search results - page 265 / 876
» Mass problems and randomness
Sort
View
INFSOF
2006
129views more  INFSOF 2006»
15 years 6 months ago
An interactive service customization model
: Mass customization has become one of the key strategies for a service provider to differentiate itself from its competitors in a highly segmented global service market. This pape...
Jian Cao, Jie Wang, Kincho H. Law, Shen-sheng Zhan...
EAAI
2007
99views more  EAAI 2007»
15 years 6 months ago
Data mining for agent reasoning: A synergy for training intelligent agents
The task-oriented nature of data mining (DM) has already been dealt successfully with the employment of intelligent agent systems that distribute tasks, collaborate and synchroniz...
Andreas L. Symeonidis, Kyriakos C. Chatzidimitriou...
ENTCS
2007
101views more  ENTCS 2007»
15 years 6 months ago
Parametric Performance Contracts: Non-Markovian Loop Modelling and an Experimental Evaluation
Even with todays hardware improvements, performance problems are still common in many software systems. An approach to tackle this problem for component-based software architectur...
Heiko Koziolek, Viktoria Firus
164
Voted
CDC
2009
IEEE
134views Control Systems» more  CDC 2009»
15 years 11 months ago
On LQG joint optimal scheduling and control under communication constraints
Abstract— In this paper, we consider a discrete-time stochastic system, where sensor measurements are sent over a network to the controller. The design objective is a non-classic...
Adam Molin, Sandra Hirche
DFG
1992
Springer
15 years 10 months ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
Miroslaw Kutylowski