Sciweavers

8766 search results - page 1490 / 1754
» Functional logic programming
Sort
View
117
Voted
CORR
2007
Springer
80views Education» more  CORR 2007»
15 years 3 months ago
Polygraphs for termination of left-linear term rewriting systems
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
Yves Guiraud
124
Voted
JCC
2008
92views more  JCC 2008»
15 years 3 months ago
Fast procedure for reconstruction of full-atom protein models from reduced representations
: We introduce PULCHRA, a fast and robust method for the reconstruction of full-atom protein models starting from a reduced protein representation. The algorithm is particularly su...
Piotr Rotkiewicz, Jeffrey Skolnick
130
Voted
JCP
2008
135views more  JCP 2008»
15 years 3 months ago
Hybrid Evolutionary Algorithm Based Solution for Register Allocation for Embedded Systems
Embedded systems have an ever-increasing need for optimizing compilers to produce high quality codes with a limited general purpose register set. Either memory or registers are use...
Anjali Mahajan, M. S. Ali
137
Voted
JDA
2006
85views more  JDA 2006»
15 years 3 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger
JDS
2006
44views more  JDS 2006»
15 years 3 months ago
Multiagent Matching Algorithms with and without Coach
The concept of "agent" has been used to describe many different artefacts: software programs, mobile robots, or even human beings. In a system consisting of many agents, ...
Frieder Stolzenburg, Jan Murray, Karsten Sturm
« Prev « First page 1490 / 1754 Last » Next »