Sciweavers

3708 search results - page 338 / 371
» Programming with C Exceptions
Sort
View
271 views 116 votes 13 years 3 months ago  PLDI 2012»
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...
165 views 99 votes 15 years 7 months ago  RECONFIG 2009»
—We envision that future FPGA will use a hardwired network on chip (HWNoC) [14] as a unified interconnect for functional communications (data and control) as well as configurat...
156 views 100 votes 15 years 7 months ago  CALCO 2009»
The exactness properties of coproducts in extensive categories and pushouts along monos in adhesive categories have found various applications in theoretical computer science, e.g....
146 views 94 votes 15 years 7 months ago  ICPR 2008»
Active set methods for training the Support Vector Machines (SVM) are advantageous since they enable incremental training and, as we show in this research, do not exhibit exponent...
152 views 115 votes 15 years 7 months ago  ICALP 2007»
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic g...
89 views 86 votes 15 years 6 months ago  FPL 2004»
Complex SoC and platform-based designs require integration of configurable IP cores from multiple sources. Even automatic compilation flows from a high-level description to HW/SW s...
107 views 86 votes 15 years 2 months ago  AAAI 2010»
Consistency properties and algorithms for achieving them are at the heart of the success of Constraint Programming. In this paper, we study the relational consistency property R(,...
59 views 114 votes 15 years 25 days ago  CSJM 2006»
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
163 views 216 votes 16 years 1 months ago  POPL 2006»
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
111 views 106 votes 15 years 5 months ago  PLDI 1996»
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...