Sciweavers

4940 search results - page 800 / 988
» On the Complexity of Universal Programs
Sort
View
ICNC
2009
Springer
16 years 1 months ago
Estimating Strength of Concrete Using a Grammatical Evolution
The main purpose of this paper is to propose an incorporating a grammatical evolution (GE) into the genetic algorithm (GA), called GEGA, and apply it to estimate the compressive s...
Hsun-Hsin Hsu, Li Chen, Chang-Huan Kou, Tai-Sheng ...
IFIP
2009
Springer
16 years 1 months ago
On Designing for Tussle: Future Internet in Retrospect
Abstract. Over the past decades, the fundamental principles of the Internet architecture have not significantly changed. However, Internet evolution and its effects on participants...
Costas Kalogiros, Alexandros Kostopoulos, Alan For...
IFIP
2009
Springer
16 years 1 months ago
A Pipelined IP Address Lookup Module for 100 Gbps Line Rates and beyond
New Internet services and technologies call for higher packet switching capacities in the core network. Thus, a performance bottleneck arises at the backbone routers, as forwarding...
Domenic Teuchert, Simon Hauger
SARA
2009
Springer
16 years 29 days ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
CF
2009
ACM
16 years 29 days ago
Strategies for dynamic memory allocation in hybrid architectures
Hybrid architectures combining the strengths of generalpurpose processors with application-specific hardware accelerators can lead to a significant performance improvement. Our ...
Peter Bertels, Wim Heirman, Dirk Stroobandt