9325 search results - page 455 / 1865 » The decentralized implementability problem |
155
click to vote
ISOLA
2007
Springer
16 years 12 days ago
2007
Springer
The testing and formal verification of black box software components is a challenging domain. The problem is even harder when specifications of these components are not available...
145
click to vote
SPIRE
2007
Springer
16 years 11 days ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
157
click to vote
ICALT
2006
IEEE
16 years 9 days ago
2006
IEEE
Teachers working in robotics classes face a major problem: how to keep track on individual students’ or even small groups’ progress in a class of 30-40 students. An agency app...
156
click to vote
IPPS
2006
IEEE
16 years 8 days ago
2006
IEEE
role assignment is a programming abstraction that supports the assignment of user-defined roles to sensor nodes such that certain conditions are met. Many common network configu...
148
click to vote
ACMSE
2006
ACM
16 years 7 days ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...