Sciweavers

3713 search results - page 364 / 743
» Constructing a Calculus of Programs
Sort
View
ICPPW
2002
IEEE
15 years 9 months ago
A Programming Methodology for Designing Block Recursive Algorithms on Various Computer Networks
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms on various computer networks. In our previ...
Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung
PODS
1989
ACM
129views Database» more  PODS 1989»
15 years 8 months ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
NIPS
1993
15 years 6 months ago
Using Local Trajectory Optimizers to Speed Up Global Optimization in Dynamic Programming
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
Christopher G. Atkeson
IJET
2007
121views more  IJET 2007»
15 years 4 months ago
A Technology Based Program That Matches Enrichment Resources With Student Strengths
Remarkable advances in instructional communication technology (ICT) have now made is possible to provide high levels of enrichment and the kinds of curricular differentiation that...
Joseph S. Renzulli, Sally M. Reis
157
Voted
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 4 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...