7796 search results - page 1215 / 1560 » On Generalized Schur Numbers |
202
click to vote
LCTRTS
2007
Springer
16 years 1 months ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
204
click to vote
SOFSEM
2007
Springer
16 years 1 months ago
2007
Springer
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
207
click to vote
CODES
2006
IEEE
16 years 1 months ago
2006
IEEE
The use of Application Specific Instruction-set Processors (ASIP) is a solution to the problem of increasing complexity in embedded systems design. One of the major challenges in...
234
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
217
click to vote
IAT
2006
IEEE
16 years 1 months ago
2006
IEEE
Trust negotiation makes it possible for two parties to carry on secure transactions by first establishing trust through a bilateral, iterative process of requesting and disclosin...