14169 search results - page 2425 / 2834 » Tabular application development |
209
click to vote
DAC
2001
ACM
16 years 8 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
296
click to vote
DAC
2006
ACM
16 years 8 months ago
2006
ACM
Fuel cells are clean power sources that have much higher energy densities and lifetimes compared to batteries. However, fuel cells have limited load following capabilities and can...
194
Voted
ICML
2002
IEEE
16 years 8 months ago
2002
IEEE
Supervised learning techniques for text classi cation often require a large number of labeled examples to learn accurately. One way to reduce the amountoflabeled datarequired is t...
200
click to vote
SIGSOFT
2007
ACM
16 years 8 months ago
2007
ACM
We present novel algorithms for parallel testing of code that takes structurally complex test inputs. The algorithms build on the Korat algorithm for constraint-based generation o...
240
Voted
SIGSOFT
2007
ACM
16 years 8 months ago
2007
ACM
Finding flaws in security protocol implementations is hard. Finding flaws in the implementations of sensor network security protocols is even harder because they are designed to p...