2398 search results - page 214 / 480 » Constraint Programming and Graph Algorithms |
133
click to vote
ICSE
2003
IEEE-ACM
16 years 6 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
193
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
195
click to vote
COMSWARE
2007
IEEE
16 years 25 days ago
2007
IEEE
Abstract— Wireless sensor networks consist of small, inexpensive devices which interact with the environment, communicate with each other, and perform distributed computations in...
219
click to vote
LCTRTS
2005
Springer
15 years 12 months ago
2005
Springer
Effective use of the memory hierarchy is critical for achieving high performance on embedded systems. We focus on the class of streaming applications, which is increasingly preval...
144
click to vote
ICASSP
2008
IEEE
16 years 28 days ago
2008
IEEE
In this paper, we cast discriminative training problems into standard linear programming (LP) optimization. Besides being convex and having globally optimal solution(s), LP progra...