6274 search results - page 368 / 1255 » Proofs, Programs, Processes |
165
click to vote
ARITH
2003
IEEE
15 years 10 months ago
2003
IEEE
Studying floating point arithmetic, authors have shown that the implemented operations (addition, subtraction, multiplication, division and square root) can compute a result and a...
162
click to vote
CCCG
2006
15 years 8 months ago
2006
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdos posed this as an open problem in 1935, several independent purport...
160
click to vote
ENTCS
2006
15 years 6 months ago
2006
Consistency checking in the CSP B approach verifies that an individual controller process, defined using a sequential non-divergent subset of CSP, never calls a B operation outsid...
179
click to vote
IPL
2008
15 years 6 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
170
click to vote
IFIPTM
2009
15 years 4 months ago
2009
To date, research in trust negotiation has focused mainly on the theoretical aspects of the trust negotiation process, and the development of proof of concept implementations. Thes...