Sciweavers

34229 search results - page 317 / 6846
» Power-aware computing systems
Sort
View
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
15 years 4 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 4 months ago
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
In this paper we study planar polynomial differential systems of this form: dX dt = X = A(X, Y ), dY dt = Y = B(X, Y ), where A, B Z[X, Y ] and deg A d, deg B d, A H and B H. ...
Guillaume Chèze
EOR
2007
102views more  EOR 2007»
15 years 4 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
PDPTA
2010
15 years 2 months ago
Distributed Mobile Computing: Development of Distributed Applications Using Mobile Agents
There exist distributed scenarios in which the need for dynamism, mobility, and adaptivity, has to be addressed with highly dynamical approaches. These scenarios present different ...
Carlos Bobed, Sergio Ilarri, Eduardo Mena
SOCIALCOM
2010
14 years 11 months ago
A Multi-factor Approach to Securing Software on Client Computing Platforms
Protecting the integrity of software platforms, especially in unmanaged consumer computing systems is a difficult problem. Attackers may attempt to execute buffer overflow attacks ...
Raghunathan Srinivasan, Vivek Iyer, Amit Kanitkar,...