12272 search results - page 413 / 2455 » Experimental program analysis |
183
click to vote
SAT
2005
Springer
16 years 9 days ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
194
click to vote
GECCO
2004
Springer
16 years 6 days ago
2004
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
173
click to vote
JELIA
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. The growing size of electronically available text corpora like companies’ intranets or the WWW has made information access a hot topic within computational linguistics....
171
click to vote
LCTRTS
2004
Springer
16 years 5 days ago
2004
Springer
While concurrency in embedded systems is most often supplied by real-time operating systems, this approach can be unpredictable and difficult to debug. Synchronous concurrency, i...
165
click to vote
SAC
2003
ACM
16 years 2 days ago
2003
ACM
We study in this paper the problem of broadcasting dependent data for unordered queries. However, most prior studies on dependent data broadcasting are limited to the premise of n...