Sciweavers

5832 search results - page 165 / 1167
» Software complexity and maintainability
Sort
View
FOSSACS
2007
Springer
15 years 10 months ago
Complexity Results on Balanced Context-Free Languages
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Akihiko Tozawa, Yasuhiko Minamide
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 10 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Abdellah Salhi, José Antonio Vázquez...
WORDS
2003
IEEE
15 years 9 months ago
Using Co-ordinated Atomic Actions for Building Complex Web Applications: A Learning Experience
This paper discusses some of the typical characteristics of modern Web applications and analyses some of the problems the developers of such systems have to face. One of such type...
Avelino F. Zorzo, Panayiotis Periorellis, Alexande...
FSTTCS
2003
Springer
15 years 9 months ago
Moderately Hard Functions: From Complexity to Spam Fighting
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
Moni Naor
ARCS
2010
Springer
15 years 8 months ago
Complexity-Effective Rename Table Design for Rapid Speculation Recovery
Register renaming is a widely used technique to remove false data dependencies in contemporary superscalar microprocessors. The register rename logic includes a mapping table that ...
Görkem Asilioglu, Emine Merve Kaya, Oguz Ergi...