Sciweavers

166 search results - page 3 / 34
» Resultants of partially composed polynomials
Sort
View
ESWS
2005
Springer
14 years 1 months ago
Optimally Distributing Interactions Between Composed Semantic Web Services
When information services are organized to provide some composed functionality, their interactions can be formally represented as workflows. Traditionally, workflows are executed...
Ion Constantinescu, Walter Binder, Boi Faltings
AIPS
2006
13 years 9 months ago
Goal Achievement in Partially Known, Partially Observable Domains
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
Allen Chang, Eyal Amir
LAWEB
2006
IEEE
14 years 1 months ago
Modeling and Composing Navigational Concerns in Web Applications. Requirements and Design Issues
Complex applications, in particular Web applications, deal with a myriad of different concerns and some of them affect several others. The result is that these crosscutting concer...
Silvia E. Gordillo, Gustavo Rossi, Ana Moreira, Jo...
ALGORITHMICA
2010
104views more  ALGORITHMICA 2010»
13 years 7 months ago
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
Liming Cai, Xiuzhen Huang
CN
2008
108views more  CN 2008»
13 years 6 months ago
An approach to the identification of network elements composing heterogeneous end-to-end paths
Today's networks are becoming increasingly complex and the ability to effectively and efficiently operate and manage them is ever more challenging. Ways to provide end-to-end...
Alessio Botta, Antonio Pescapè, Giorgio Ven...