4480 search results - page 515 / 896 » Prototyping Completion with Constraints Using Computational ... |
146
click to vote
MOC
2002
15 years 6 months ago
2002
We answer a question left open in an article of Coppersmith and Davenport which proved the existence of polynomials whose powers are sparse, and in particular polynomials whose squ...
167
click to vote
SCL
2010
15 years 1 months ago
2010
The input-state incidence matrix of control Boolean network is proposed. It is shown that this matrix contains complete information of the input-state mapping. Using it, an easily...
170
click to vote
SACMAT
2009
ACM
16 years 1 months ago
2009
ACM
A number of research systems have demonstrated the benefits of accompanying each request with a machine-checkable proof that the request complies with access-control policy — a...
174
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the oldest and best known approaches to the problem of designing useful paraconsi...
163
click to vote
SIGCOMM
2009
ACM
16 years 1 months ago
2009
ACM
SMS-based web search is different from traditional web search in that the final response to a search query is limited to a very small number of bytes (typically 1-2 SMS messages...