Sciweavers

952 search results - page 145 / 191
» Computational complexity of stochastic programming problems
Sort
View
133
Voted
MFCS
2005
Springer
15 years 8 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
ICALP
2009
Springer
16 years 2 months ago
On Regular Temporal Logics with Past,
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange
SIGSOFT
2010
ACM
15 years 15 days ago
Building scalable software systems in the multicore era
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...
Hridesh Rajan
111
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Cheap semidefinite relaxation MIMO detection using row-by-row block coordinate descent
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...
Hoi-To Wai, Wing-Kin Ma, Anthony Man-Cho So
111
Voted
C5
2008
IEEE
15 years 9 months ago
Toward A More Scalable End-User Scripting Language
End-user scripting languages are relatively easy to learn, but have limited expressive power. Tile-based scripting systems are particularly accessible to beginners, but usually ar...
Alessandro Warth, Takashi Yamamiya, Yoshiki Ohshim...