13841 search results - page 2614 / 2769 » Algorithms and Constraint Programming |
141
click to vote
DLT
2006
15 years 4 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
123
Voted
ERSA
2006
15 years 4 months ago
2006
In this case study, various ways to partition a code between the microprocessor and FPGA are examined. Discrete image convolution operation with separable kernel is used as the ca...
149
click to vote
ICWN
2004
15 years 4 months ago
2004
A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many ...
110
click to vote
DAGSTUHL
2003
15 years 4 months ago
2003
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capabi...
128
click to vote
GRAPHICSINTERFACE
2001
15 years 4 months ago
2001
While traditional graphics techniques provide for the realistic display of three-dimensional objects, these methods often lack the flexibility to emulate expressive effects found ...